./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:40:53,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:40:53,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:40:54,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:40:54,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:40:54,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:40:54,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:40:54,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:40:54,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:40:54,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:40:54,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:40:54,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:40:54,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:40:54,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:40:54,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:40:54,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:40:54,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:40:54,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:40:54,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:40:54,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:40:54,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:40:54,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:40:54,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:40:54,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:40:54,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:40:54,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:40:54,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:40:54,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:40:54,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:40:54,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:40:54,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:40:54,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:40:54,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:40:54,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:40:54,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:40:54,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:40:54,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:40:54,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:40:54,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:40:54,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:40:54,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:40:54,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:40:54,101 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:40:54,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:40:54,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:40:54,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:40:54,102 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:40:54,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:40:54,103 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:40:54,103 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:40:54,103 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:40:54,103 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:40:54,104 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:40:54,104 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:40:54,104 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:40:54,104 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:40:54,105 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:40:54,105 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:40:54,105 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:40:54,105 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:40:54,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:40:54,106 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:40:54,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:40:54,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:40:54,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:40:54,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:40:54,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:40:54,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:40:54,108 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:40:54,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:40:54,108 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:40:54,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:40:54,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:40:54,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:40:54,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:40:54,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:40:54,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:40:54,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:40:54,110 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:40:54,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:40:54,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:40:54,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:40:54,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:40:54,111 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2021-11-25 18:40:54,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:40:54,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:40:54,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:40:54,441 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:40:54,442 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:40:54,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-25 18:40:54,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/aa83f82cd/48a071749a644c829b0650ec057fdf16/FLAG424bb55b2 [2021-11-25 18:40:55,029 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:40:55,030 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-25 18:40:55,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/aa83f82cd/48a071749a644c829b0650ec057fdf16/FLAG424bb55b2 [2021-11-25 18:40:55,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/aa83f82cd/48a071749a644c829b0650ec057fdf16 [2021-11-25 18:40:55,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:40:55,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:40:55,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:40:55,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:40:55,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:40:55,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f82816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55, skipping insertion in model container [2021-11-25 18:40:55,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:40:55,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:40:55,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-25 18:40:55,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:40:55,681 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:40:55,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-25 18:40:55,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:40:55,722 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:40:55,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55 WrapperNode [2021-11-25 18:40:55,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:40:55,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:40:55,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:40:55,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:40:55,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,760 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2021-11-25 18:40:55,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:40:55,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:40:55,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:40:55,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:40:55,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:40:55,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:40:55,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:40:55,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:40:55,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (1/1) ... [2021-11-25 18:40:55,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:40:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:40:55,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:40:55,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:40:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:40:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-25 18:40:55,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-25 18:40:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:40:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:40:55,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:40:55,939 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:40:55,941 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:40:56,096 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:40:56,125 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:40:56,129 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 18:40:56,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:40:56 BoogieIcfgContainer [2021-11-25 18:40:56,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:40:56,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:40:56,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:40:56,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:40:56,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:40:55" (1/3) ... [2021-11-25 18:40:56,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fa339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:40:56, skipping insertion in model container [2021-11-25 18:40:56,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:40:55" (2/3) ... [2021-11-25 18:40:56,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fa339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:40:56, skipping insertion in model container [2021-11-25 18:40:56,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:40:56" (3/3) ... [2021-11-25 18:40:56,148 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2021-11-25 18:40:56,154 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:40:56,154 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 18:40:56,222 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:40:56,234 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:40:56,234 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 18:40:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:40:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 18:40:56,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:40:56,267 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:40:56,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:40:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:40:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1286672979, now seen corresponding path program 1 times [2021-11-25 18:40:56,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:40:56,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798144671] [2021-11-25 18:40:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:40:56,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:40:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:40:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:40:56,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:40:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798144671] [2021-11-25 18:40:56,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798144671] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:40:56,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:40:56,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:40:56,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110087418] [2021-11-25 18:40:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:40:56,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:40:56,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:40:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:40:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:40:56,593 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:40:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:40:56,629 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-11-25 18:40:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:40:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2021-11-25 18:40:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:40:56,639 INFO L225 Difference]: With dead ends: 20 [2021-11-25 18:40:56,639 INFO L226 Difference]: Without dead ends: 12 [2021-11-25 18:40:56,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:40:56,647 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:40:56,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:40:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-25 18:40:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-25 18:40:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:40:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-25 18:40:56,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 12 [2021-11-25 18:40:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:40:56,686 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-25 18:40:56,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:40:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-25 18:40:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:40:56,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:40:56,689 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:40:56,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:40:56,689 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:40:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:40:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1194110661, now seen corresponding path program 1 times [2021-11-25 18:40:56,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:40:56,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730511244] [2021-11-25 18:40:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:40:56,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:40:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:40:56,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 18:40:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:40:56,756 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 18:40:56,757 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 18:40:56,759 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 18:40:56,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:40:56,769 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-25 18:40:56,772 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:40:56,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:40:56 BoogieIcfgContainer [2021-11-25 18:40:56,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:40:56,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:40:56,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:40:56,811 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:40:56,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:40:56" (3/4) ... [2021-11-25 18:40:56,815 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-25 18:40:56,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:40:56,818 INFO L158 Benchmark]: Toolchain (without parser) took 1413.38ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 48.8MB in the end (delta: 26.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2021-11-25 18:40:56,818 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:40:56,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.59ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 85.6MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:40:56,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.06ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 84.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:40:56,827 INFO L158 Benchmark]: Boogie Preprocessor took 24.86ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:40:56,827 INFO L158 Benchmark]: RCFGBuilder took 345.11ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 73.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:40:56,828 INFO L158 Benchmark]: TraceAbstraction took 674.65ms. Allocated memory is still 109.1MB. Free memory was 73.0MB in the beginning and 49.1MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-25 18:40:56,829 INFO L158 Benchmark]: Witness Printer took 5.43ms. Allocated memory is still 109.1MB. Free memory was 49.1MB in the beginning and 48.8MB in the end (delta: 257.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:40:56,838 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.59ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 85.6MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.06ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 84.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.86ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.11ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 73.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 674.65ms. Allocated memory is still 109.1MB. Free memory was 73.0MB in the beginning and 49.1MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 5.43ms. Allocated memory is still 109.1MB. Free memory was 49.1MB in the beginning and 48.8MB in the end (delta: 257.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L21] CALL assume_abort_if_not(x > -1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L21] RET assume_abort_if_not(x > -1.0) [L22] CALL assume_abort_if_not(x < 1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x < 1.0) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; VAL [count=1, exp=1, term=1] [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 VAL [count=2, temp=0] [L39] CALL __VERIFIER_assert( result >= exp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-25 18:40:56,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:40:59,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:40:59,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:40:59,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:40:59,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:40:59,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:40:59,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:40:59,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:40:59,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:40:59,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:40:59,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:40:59,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:40:59,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:40:59,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:40:59,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:40:59,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:40:59,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:40:59,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:40:59,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:40:59,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:40:59,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:40:59,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:40:59,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:40:59,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:40:59,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:40:59,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:40:59,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:40:59,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:40:59,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:40:59,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:40:59,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:40:59,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:40:59,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:40:59,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:40:59,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:40:59,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:40:59,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:40:59,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:40:59,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:40:59,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:40:59,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:40:59,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-25 18:40:59,434 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:40:59,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:40:59,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:40:59,435 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:40:59,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:40:59,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:40:59,437 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:40:59,437 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:40:59,437 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:40:59,437 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:40:59,438 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:40:59,439 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:40:59,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:40:59,440 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:40:59,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:40:59,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:40:59,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:40:59,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:40:59,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:40:59,441 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:40:59,442 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 18:40:59,442 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 18:40:59,442 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:40:59,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:40:59,442 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:40:59,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:40:59,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:40:59,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 18:40:59,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:40:59,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:40:59,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:40:59,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:40:59,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:40:59,445 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 18:40:59,445 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 18:40:59,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:40:59,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:40:59,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:40:59,446 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2021-11-25 18:40:59,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:40:59,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:40:59,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:40:59,892 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:40:59,892 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:40:59,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-25 18:40:59,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/deae11b20/eca06ec2aeb2467382f1372ec6dc0174/FLAG7670a229a [2021-11-25 18:41:00,502 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:41:00,503 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2021-11-25 18:41:00,510 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/deae11b20/eca06ec2aeb2467382f1372ec6dc0174/FLAG7670a229a [2021-11-25 18:41:00,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/data/deae11b20/eca06ec2aeb2467382f1372ec6dc0174 [2021-11-25 18:41:00,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:41:00,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:41:00,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:41:00,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:41:00,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:41:00,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:41:00" (1/1) ... [2021-11-25 18:41:00,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57429567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:00, skipping insertion in model container [2021-11-25 18:41:00,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:41:00" (1/1) ... [2021-11-25 18:41:00,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:41:00,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:41:01,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-25 18:41:01,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:41:01,166 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:41:01,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2021-11-25 18:41:01,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:41:01,224 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:41:01,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01 WrapperNode [2021-11-25 18:41:01,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:41:01,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:41:01,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:41:01,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:41:01,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,270 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2021-11-25 18:41:01,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:41:01,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:41:01,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:41:01,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:41:01,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:41:01,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:41:01,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:41:01,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:41:01,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (1/1) ... [2021-11-25 18:41:01,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:41:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:41:01,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:41:01,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:41:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:41:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-25 18:41:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-25 18:41:01,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-25 18:41:01,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:41:01,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:41:01,517 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:41:01,519 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:41:04,099 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:41:04,105 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:41:04,105 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 18:41:04,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:41:04 BoogieIcfgContainer [2021-11-25 18:41:04,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:41:04,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:41:04,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:41:04,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:41:04,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:41:00" (1/3) ... [2021-11-25 18:41:04,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3462ee51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:41:04, skipping insertion in model container [2021-11-25 18:41:04,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:41:01" (2/3) ... [2021-11-25 18:41:04,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3462ee51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:41:04, skipping insertion in model container [2021-11-25 18:41:04,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:41:04" (3/3) ... [2021-11-25 18:41:04,115 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2021-11-25 18:41:04,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:41:04,120 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 18:41:04,166 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:41:04,173 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:41:04,174 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 18:41:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:41:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:41:04,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:41:04,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:41:04,196 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:41:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:41:04,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1019803906, now seen corresponding path program 1 times [2021-11-25 18:41:04,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:41:04,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348013929] [2021-11-25 18:41:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:41:04,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:41:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:41:04,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:41:04,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-25 18:41:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:41:04,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-25 18:41:04,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:41:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:41:04,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:41:04,809 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:41:04,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348013929] [2021-11-25 18:41:04,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348013929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:41:04,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:41:04,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:41:04,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330199381] [2021-11-25 18:41:04,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:41:04,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:41:04,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:41:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:41:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:41:04,881 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:41:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:41:04,903 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-11-25 18:41:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:41:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-25 18:41:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:41:04,914 INFO L225 Difference]: With dead ends: 35 [2021-11-25 18:41:04,914 INFO L226 Difference]: Without dead ends: 15 [2021-11-25 18:41:04,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:41:04,924 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:41:04,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:41:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-25 18:41:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-25 18:41:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:41:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-11-25 18:41:04,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 17 [2021-11-25 18:41:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:41:04,975 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-11-25 18:41:04,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:41:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-11-25 18:41:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:41:04,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:41:04,979 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:41:05,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:41:05,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:41:05,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:41:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:41:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1211444824, now seen corresponding path program 1 times [2021-11-25 18:41:05,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:41:05,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078440856] [2021-11-25 18:41:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:41:05,198 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:41:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:41:05,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:41:05,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-25 18:41:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:41:06,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:41:06,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:41:34,136 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= .cse0 |c_ULTIMATE.start_main_~term~0#1|) (= .cse0 |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse1 (fp.neg .cse2)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x~0#1|))))) (= (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt .cse1 .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-25 18:41:50,646 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (fp.lt .cse2 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|)))) is different from false [2021-11-25 18:41:52,697 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (fp.lt .cse2 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|)))) is different from true [2021-11-25 18:43:06,821 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)))) (fp.gt .cse4 (fp.neg .cse3)) (fp.lt .cse4 .cse3)))) is different from true [2021-11-25 18:43:23,499 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from false [2021-11-25 18:43:25,550 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from true [2021-11-25 18:43:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:43:25,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:43:25,552 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:43:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078440856] [2021-11-25 18:43:25,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078440856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:25,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:25,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 18:43:25,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635954603] [2021-11-25 18:43:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:25,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:43:25,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:43:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:43:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=28, Unknown=6, NotChecked=52, Total=110 [2021-11-25 18:43:25,557 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:43:29,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:43:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:29,564 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-11-25 18:43:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:43:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-11-25 18:43:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:29,614 INFO L225 Difference]: With dead ends: 21 [2021-11-25 18:43:29,614 INFO L226 Difference]: Without dead ends: 17 [2021-11-25 18:43:29,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=29, Invalid=37, Unknown=6, NotChecked=60, Total=132 [2021-11-25 18:43:29,617 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:29,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 1 Unknown, 44 Unchecked, 3.9s Time] [2021-11-25 18:43:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-25 18:43:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-25 18:43:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:43:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-25 18:43:29,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 18 [2021-11-25 18:43:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:29,628 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-25 18:43:29,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:43:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-25 18:43:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:43:29,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:29,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:29,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:43:29,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:43:29,835 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:43:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 311013171, now seen corresponding path program 1 times [2021-11-25 18:43:29,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:43:29,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679335706] [2021-11-25 18:43:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:29,838 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:43:29,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:43:29,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:43:29,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-25 18:43:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:40,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-25 18:43:40,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:31,029 WARN L227 SmtUtils]: Spent 17.23s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:45:02,536 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse0 .cse1) (= (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~term~0#1|) |c_ULTIMATE.start_main_~exp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))))) is different from false [2021-11-25 18:45:47,638 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|) (= |c_ULTIMATE.start_main_~exp~0#1| (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))))) is different from false [2021-11-25 18:45:49,692 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (= (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) |c_ULTIMATE.start_main_~result~0#1|) (= |c_ULTIMATE.start_main_~exp~0#1| (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))))) is different from true [2021-11-25 18:46:47,454 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) (fp.gt .cse5 (fp.neg .cse4)) (fp.lt .cse5 .cse4)))) is different from false [2021-11-25 18:46:49,512 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) (fp.gt .cse5 (fp.neg .cse4)) (fp.lt .cse5 .cse4)))) is different from true [2021-11-25 18:47:05,363 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from false [2021-11-25 18:47:07,417 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from true [2021-11-25 18:47:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-11-25 18:47:07,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:47:18,077 WARN L838 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from false [2021-11-25 18:47:20,135 WARN L860 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) is different from true [2021-11-25 18:47:30,563 WARN L838 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|))))))) is different from false [2021-11-25 18:47:32,666 WARN L860 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|))))))) is different from true [2021-11-25 18:47:38,866 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from false [2021-11-25 18:47:40,935 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from true [2021-11-25 18:47:50,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from false [2021-11-25 18:47:52,960 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from true [2021-11-25 18:48:03,436 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|) .cse0) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))))) is different from true [2021-11-25 18:48:22,289 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|) .cse0) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (= c_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-25 18:48:37,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from false [2021-11-25 18:48:40,051 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from true [2021-11-25 18:48:40,051 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:48:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679335706] [2021-11-25 18:48:40,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679335706] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:48:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749647327] [2021-11-25 18:48:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:48:40,053 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:48:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:48:40,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:48:40,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-11-25 18:48:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:48:42,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-25 18:48:42,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:51:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-11-25 18:51:29,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:52:06,412 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse3))))) is different from true [2021-11-25 18:52:25,335 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse3)))) (= c_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-25 18:52:39,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1749647327] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:52:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606737541] [2021-11-25 18:52:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:39,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:52:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:52:39,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:52:39,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fe6a64-b433-4569-a221-aa8c1d01d9f6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:54:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:39,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-25 18:54:39,635 INFO L286 TraceCheckSpWp]: Computing forward predicates...