./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:03:00,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:03:00,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:03:00,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:03:00,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:03:00,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:03:00,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:03:00,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:03:00,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:03:00,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:03:00,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:03:00,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:03:00,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:03:00,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:03:00,302 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:03:00,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:03:00,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:03:00,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:03:00,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:03:00,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:03:00,304 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:03:00,304 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2025-03-17 20:03:00,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:03:00,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:03:00,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:03:00,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:03:00,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:03:00,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-17 20:03:01,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62716b85d/72fd777270cd44368c8237e6c7e5fc8b/FLAG9ee1a8f7f [2025-03-17 20:03:01,957 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:03:01,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-17 20:03:01,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62716b85d/72fd777270cd44368c8237e6c7e5fc8b/FLAG9ee1a8f7f [2025-03-17 20:03:02,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62716b85d/72fd777270cd44368c8237e6c7e5fc8b [2025-03-17 20:03:02,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:03:02,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:03:02,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:02,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:03:02,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:03:02,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e94045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02, skipping insertion in model container [2025-03-17 20:03:02,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:03:02,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:02,456 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:03:02,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:02,488 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:03:02,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02 WrapperNode [2025-03-17 20:03:02,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:02,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:02,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:03:02,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:03:02,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,519 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 11, calls inlined = 9, statements flattened = 352 [2025-03-17 20:03:02,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:02,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:03:02,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:03:02,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:03:02,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 20:03:02,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:03:02,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:03:02,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:03:02,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:03:02,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (1/1) ... [2025-03-17 20:03:02,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:02,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:02,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:03:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:03:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:03:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:03:02,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:03:02,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:03:02,665 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:03:03,064 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-17 20:03:03,064 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:03:03,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:03:03,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:03:03,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:03 BoogieIcfgContainer [2025-03-17 20:03:03,083 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:03:03,083 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:03:03,083 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:03:03,087 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:03:03,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:03,088 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:03:02" (1/3) ... [2025-03-17 20:03:03,089 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64aa661b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:03, skipping insertion in model container [2025-03-17 20:03:03,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:03,089 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:02" (2/3) ... [2025-03-17 20:03:03,089 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64aa661b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:03, skipping insertion in model container [2025-03-17 20:03:03,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:03,090 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:03" (3/3) ... [2025-03-17 20:03:03,090 INFO L363 chiAutomizerObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2025-03-17 20:03:03,123 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:03:03,123 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:03:03,123 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:03:03,123 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:03:03,123 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:03:03,124 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:03:03,124 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:03:03,124 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:03:03,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 100 states, 99 states have (on average 1.696969696969697) internal successors, (168), 99 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:03,143 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-03-17 20:03:03,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:03,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:03,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:03:03,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:03,149 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:03:03,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 100 states, 99 states have (on average 1.696969696969697) internal successors, (168), 99 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:03,154 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-03-17 20:03:03,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:03,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:03,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:03:03,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:03,159 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:03,160 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:03,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash 253180, now seen corresponding path program 1 times [2025-03-17 20:03:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:03,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272765979] [2025-03-17 20:03:03,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:03,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:03,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:03,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:03,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:03,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272765979] [2025-03-17 20:03:03,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272765979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:03,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:03,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878699227] [2025-03-17 20:03:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:03,376 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:03,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 7643, now seen corresponding path program 1 times [2025-03-17 20:03:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166278910] [2025-03-17 20:03:03,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:03,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:03,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:03,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:03,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:03,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:03,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:03,445 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:03,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:03,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:03,446 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:03,446 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:03,446 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:03,446 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:03,446 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:03,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2025-03-17 20:03:03,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:03,447 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:03,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:03,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:03,576 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:03,576 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:03,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:03:03,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:03,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:03,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:03,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:03,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:03,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:03:03,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:03,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:03,630 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:03,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 20:03:03,637 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:03,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:03,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:03,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:03,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:03,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:03,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:03,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:03,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2025-03-17 20:03:03,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:03,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:03,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:03,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:03,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:03,743 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:03,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:03,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:03,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:03:03,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:03,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:03,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:03,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:03,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:03,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:03,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:03,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:03,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:03,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:03,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:03,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:03,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:03:03,777 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:03,777 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:03,778 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:03,778 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:03,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:03:03,786 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:03,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:03,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:03,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:03,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:03,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:03,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:03,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:03,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:03,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:03,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:03,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:03,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:03,887 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:03,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 100 states, 99 states have (on average 1.696969696969697) internal successors, (168), 99 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:03,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 100 states, 99 states have (on average 1.696969696969697) internal successors, (168), 99 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 303 states and 499 transitions. Complement of second has 6 states. [2025-03-17 20:03:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2025-03-17 20:03:03,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 330 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 20:03:03,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:04,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 330 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 20:03:04,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:04,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 330 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 20:03:04,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:04,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 499 transitions. [2025-03-17 20:03:04,007 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 26 [2025-03-17 20:03:04,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 100 states and 161 transitions. [2025-03-17 20:03:04,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-03-17 20:03:04,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-17 20:03:04,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 161 transitions. [2025-03-17 20:03:04,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:04,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 161 transitions. [2025-03-17 20:03:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 161 transitions. [2025-03-17 20:03:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2025-03-17 20:03:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 83 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 140 transitions. [2025-03-17 20:03:04,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 140 transitions. [2025-03-17 20:03:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:04,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:04,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:04,047 INFO L87 Difference]: Start difference. First operand 84 states and 140 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:04,111 INFO L93 Difference]: Finished difference Result 39 states and 60 transitions. [2025-03-17 20:03:04,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 60 transitions. [2025-03-17 20:03:04,111 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-03-17 20:03:04,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 60 transitions. [2025-03-17 20:03:04,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 20:03:04,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 20:03:04,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 60 transitions. [2025-03-17 20:03:04,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:03:04,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 60 transitions. [2025-03-17 20:03:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 60 transitions. [2025-03-17 20:03:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 20:03:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 38 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2025-03-17 20:03:04,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 60 transitions. [2025-03-17 20:03:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:04,118 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 60 transitions. [2025-03-17 20:03:04,118 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:03:04,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 60 transitions. [2025-03-17 20:03:04,118 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-03-17 20:03:04,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:04,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:04,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:04,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:04,119 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret19#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:04,119 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 243250424, now seen corresponding path program 1 times [2025-03-17 20:03:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-03-17 20:03:04,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:04,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:04,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:04,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:04,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:04,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:04,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash 6427, now seen corresponding path program 1 times [2025-03-17 20:03:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487168638] [2025-03-17 20:03:04,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1835428946, now seen corresponding path program 1 times [2025-03-17 20:03:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570953424] [2025-03-17 20:03:04,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:04,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:04,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:04,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:04,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:04,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:04,213 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:04,213 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:04,213 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:04,213 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:04,213 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:04,213 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,213 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:04,213 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:04,213 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2025-03-17 20:03:04,213 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:04,213 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:04,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,303 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:04,304 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:03:04,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:04,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:04,329 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:04,329 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:04,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:04,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:03:04,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:04,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:04,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:03:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:03:04,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:04,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:04,379 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:04,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 20:03:04,385 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:04,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:04,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:04,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:04,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:04,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:04,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:04,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2025-03-17 20:03:04,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:04,386 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:04,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 20:03:04,496 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:04,496 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:03:04,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:04,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:04,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:04,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:04,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:04,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:04,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:04,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:04,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:04,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:04,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:03:04,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:04,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:04,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:04,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:04,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:04,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:04,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:04,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:04,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:04,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:04,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:04,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:03:04,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:04,546 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:04,546 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:04,546 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:04,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 20:03:04,552 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:04,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:04,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:04,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:04,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:04,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:04,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:04,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:04,602 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:04,603 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 60 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 60 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 118 transitions. Complement of second has 5 states. [2025-03-17 20:03:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-17 20:03:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 20:03:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 20:03:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:03:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:04,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 118 transitions. [2025-03-17 20:03:04,640 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 18 [2025-03-17 20:03:04,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 72 states and 109 transitions. [2025-03-17 20:03:04,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-17 20:03:04,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 20:03:04,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 109 transitions. [2025-03-17 20:03:04,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:04,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-03-17 20:03:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 109 transitions. [2025-03-17 20:03:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2025-03-17 20:03:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2025-03-17 20:03:04,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2025-03-17 20:03:04,646 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2025-03-17 20:03:04,646 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:03:04,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2025-03-17 20:03:04,647 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-03-17 20:03:04,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:04,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:04,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:04,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:04,647 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret19#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-17 20:03:04,648 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-17 20:03:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash 243250425, now seen corresponding path program 1 times [2025-03-17 20:03:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648615193] [2025-03-17 20:03:04,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:04,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648615193] [2025-03-17 20:03:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648615193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190070091] [2025-03-17 20:03:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:04,716 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:04,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,716 INFO L85 PathProgramCache]: Analyzing trace with hash 6687, now seen corresponding path program 1 times [2025-03-17 20:03:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992369199] [2025-03-17 20:03:04,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:04,745 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:04,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:04,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:04,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:04,745 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:04,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:04,745 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:04,745 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2025-03-17 20:03:04,745 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:04,745 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:04,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,835 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:04,835 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,837 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:03:04,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:04,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:04,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:04,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,859 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:03:04,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:04,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:04,879 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:04,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:04,883 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:04,883 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:04,883 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:04,883 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:04,883 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:04,883 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,884 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:04,884 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:04,884 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2025-03-17 20:03:04,884 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:04,884 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:04,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:04,950 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:04,950 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:04,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,953 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:03:04,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:04,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:04,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:04,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:04,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:04,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:04,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:04,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:04,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:04,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:03:04,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,976 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:03:04,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:04,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:04,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:04,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:04,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:04,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:04,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:04,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:04,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:04,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:04,994 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:04,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,996 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:04,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:03:04,999 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:04,999 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:04,999 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:04,999 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-17 20:03:05,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:03:05,007 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:05,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:05,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:05,046 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:03:05,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 63 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 63 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 122 transitions. Complement of second has 5 states. [2025-03-17 20:03:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-17 20:03:05,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 20:03:05,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 20:03:05,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:03:05,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 122 transitions. [2025-03-17 20:03:05,075 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-03-17 20:03:05,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 73 states and 112 transitions. [2025-03-17 20:03:05,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-17 20:03:05,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-03-17 20:03:05,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 112 transitions. [2025-03-17 20:03:05,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:05,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 112 transitions. [2025-03-17 20:03:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 112 transitions. [2025-03-17 20:03:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2025-03-17 20:03:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2025-03-17 20:03:05,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 67 transitions. [2025-03-17 20:03:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:05,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:05,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:05,081 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:05,123 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2025-03-17 20:03:05,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2025-03-17 20:03:05,123 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:03:05,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2025-03-17 20:03:05,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-17 20:03:05,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-17 20:03:05,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2025-03-17 20:03:05,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:05,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 58 transitions. [2025-03-17 20:03:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2025-03-17 20:03:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-03-17 20:03:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2025-03-17 20:03:05,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-03-17 20:03:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:05,127 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-03-17 20:03:05,127 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:03:05,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 57 transitions. [2025-03-17 20:03:05,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:03:05,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:05,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:05,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:05,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:05,128 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret19#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" "assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:05,128 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1384411776, now seen corresponding path program 1 times [2025-03-17 20:03:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553292715] [2025-03-17 20:03:05,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:05,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:05,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553292715] [2025-03-17 20:03:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553292715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:03:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147993713] [2025-03-17 20:03:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:05,206 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:05,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 5211, now seen corresponding path program 1 times [2025-03-17 20:03:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309008779] [2025-03-17 20:03:05,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:05,235 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,235 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,235 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,235 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:05,235 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,235 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2025-03-17 20:03:05,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,309 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:05,309 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:05,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,311 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:03:05,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:05,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:03:05,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,332 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:03:05,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:05,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,355 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:05,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:03:05,359 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,359 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,359 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,359 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,359 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:05,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2025-03-17 20:03:05,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,359 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:05,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 20:03:05,461 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:05,461 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:05,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,463 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:03:05,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:05,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:05,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:05,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:05,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:05,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:05,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:05,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:05,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:05,481 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:05,481 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:05,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,483 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:03:05,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:05,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:05,486 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:05,486 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:05,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:05,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:05,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:05,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:05,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:05,544 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:05,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 57 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 57 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 90 transitions. Complement of second has 5 states. [2025-03-17 20:03:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-17 20:03:05,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-17 20:03:05,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 20:03:05,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 20:03:05,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 90 transitions. [2025-03-17 20:03:05,575 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-03-17 20:03:05,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 57 states and 81 transitions. [2025-03-17 20:03:05,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-17 20:03:05,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-17 20:03:05,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 81 transitions. [2025-03-17 20:03:05,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:05,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 81 transitions. [2025-03-17 20:03:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 81 transitions. [2025-03-17 20:03:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2025-03-17 20:03:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 40 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-17 20:03:05,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-17 20:03:05,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:05,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:03:05,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:03:05,582 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:05,649 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2025-03-17 20:03:05,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2025-03-17 20:03:05,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:03:05,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 20:03:05,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 20:03:05,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-17 20:03:05,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2025-03-17 20:03:05,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:05,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 20:03:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2025-03-17 20:03:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 20:03:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 40 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 20:03:05,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 20:03:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:03:05,653 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 20:03:05,653 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:03:05,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 59 transitions. [2025-03-17 20:03:05,654 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:03:05,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:05,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:05,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:05,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:05,654 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret19#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" "assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-17 20:03:05,654 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-17 20:03:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1092814811, now seen corresponding path program 1 times [2025-03-17 20:03:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220744444] [2025-03-17 20:03:05,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:03:05,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:03:05,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220744444] [2025-03-17 20:03:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220744444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:03:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285262661] [2025-03-17 20:03:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:03:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,737 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 20:03:05,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:03:05,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:03:05,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:05,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:03:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:05,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285262661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:03:05,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:03:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2025-03-17 20:03:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627384604] [2025-03-17 20:03:05,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:03:05,800 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:05,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 5471, now seen corresponding path program 1 times [2025-03-17 20:03:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806027808] [2025-03-17 20:03:05,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:05,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:05,830 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,830 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,830 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:05,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,830 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,830 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2025-03-17 20:03:05,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,830 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,891 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:05,891 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:05,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,893 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:03:05,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:05,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 20:03:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,916 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:05,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 20:03:05,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:05,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,938 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:05,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:03:05,943 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,943 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,943 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:05,943 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,943 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,943 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,943 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2025-03-17 20:03:05,943 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,943 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,007 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,008 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:06,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,010 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 20:03:06,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:06,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:06,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:06,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:06,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,028 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:03:06,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:06,030 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:06,030 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:06,030 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-17 20:03:06,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:03:06,037 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:06,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:03:06,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:03:06,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:06,079 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:03:06,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 59 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 59 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 93 transitions. Complement of second has 5 states. [2025-03-17 20:03:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-17 20:03:06,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 20:03:06,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 20:03:06,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 20:03:06,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2025-03-17 20:03:06,099 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:03:06,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 58 states and 83 transitions. [2025-03-17 20:03:06,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-17 20:03:06,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-03-17 20:03:06,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 83 transitions. [2025-03-17 20:03:06,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:06,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-03-17 20:03:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 83 transitions. [2025-03-17 20:03:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2025-03-17 20:03:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 42 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2025-03-17 20:03:06,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 63 transitions. [2025-03-17 20:03:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:06,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:03:06,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:03:06,101 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:06,191 INFO L93 Difference]: Finished difference Result 73 states and 108 transitions. [2025-03-17 20:03:06,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 108 transitions. [2025-03-17 20:03:06,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:03:06,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 105 transitions. [2025-03-17 20:03:06,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-03-17 20:03:06,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-17 20:03:06,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 105 transitions. [2025-03-17 20:03:06,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:06,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 105 transitions. [2025-03-17 20:03:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 105 transitions. [2025-03-17 20:03:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2025-03-17 20:03:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 47 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 20:03:06,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 20:03:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:03:06,197 INFO L432 stractBuchiCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 20:03:06,197 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:03:06,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 71 transitions. [2025-03-17 20:03:06,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:03:06,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:06,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:06,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:06,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:06,198 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret19#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_#t~bitwise4#1 := 0;" "base2flt_~m#1 := base2flt_#t~bitwise4#1;havoc base2flt_#t~bitwise4#1;" "assume 0 == base2flt_~m#1 % 4294967296 || base2flt_~m#1 % 4294967296 == 16777216 * ((128 + base2flt_~e#1) % 4294967296) % 4294967296;base2flt_#t~bitwise5#1 := 16777216 * ((128 + base2flt_~e#1) % 4294967296);" "base2flt_~res~0#1 := base2flt_#t~bitwise5#1;havoc base2flt_#t~bitwise5#1;base2flt_~__retres4~0#1 := base2flt_~res~0#1;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:06,198 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash -395061252, now seen corresponding path program 1 times [2025-03-17 20:03:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132030264] [2025-03-17 20:03:06,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:03:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:03:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132030264] [2025-03-17 20:03:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132030264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:03:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047887956] [2025-03-17 20:03:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:06,262 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:06,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 3995, now seen corresponding path program 1 times [2025-03-17 20:03:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535387843] [2025-03-17 20:03:06,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:03:06,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,289 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,289 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,289 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,289 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,289 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:06,289 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,289 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,289 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,289 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2025-03-17 20:03:06,289 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,289 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,361 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,361 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:06,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,364 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:03:06,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:06,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,383 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:06,383 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:06,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,389 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:03:06,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:06,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:03:06,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,409 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:03:06,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:06,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,433 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:06,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:03:06,437 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,437 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:06,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,437 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,437 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2025-03-17 20:03:06,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,438 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,510 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,510 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:06,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,512 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:03:06,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:06,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:06,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,535 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:03:06,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:06,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:06,549 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:06,549 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:06,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,551 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:03:06,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:06,553 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:06,553 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:06,554 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:06,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,560 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:06,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:03:06,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:03:06,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:06,617 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:06,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 71 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,625 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 71 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 73 transitions. Complement of second has 4 states. [2025-03-17 20:03:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-17 20:03:06,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 55 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-17 20:03:06,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 55 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-17 20:03:06,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 55 transitions. Stem has 16 letters. Loop has 4 letters. [2025-03-17 20:03:06,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2025-03-17 20:03:06,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:03:06,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 46 states and 68 transitions. [2025-03-17 20:03:06,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 20:03:06,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 20:03:06,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 68 transitions. [2025-03-17 20:03:06,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:06,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 20:03:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 68 transitions. [2025-03-17 20:03:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 20:03:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 45 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 20:03:06,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 20:03:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:06,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:06,628 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:06,677 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2025-03-17 20:03:06,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2025-03-17 20:03:06,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:03:06,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 73 transitions. [2025-03-17 20:03:06,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-17 20:03:06,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:03:06,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 73 transitions. [2025-03-17 20:03:06,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:06,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-03-17 20:03:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 73 transitions. [2025-03-17 20:03:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-17 20:03:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.446808510638298) internal successors, (68), 46 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-17 20:03:06,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-17 20:03:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:06,680 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-17 20:03:06,680 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:03:06,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 68 transitions. [2025-03-17 20:03:06,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:03:06,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:06,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:06,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:06,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:06,682 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret19#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume 4278190079 == base2flt_~m#1 % 4294967296;base2flt_#t~bitwise4#1 := base2flt_~m#1;" "base2flt_~m#1 := base2flt_#t~bitwise4#1;havoc base2flt_#t~bitwise4#1;" "assume 0 == base2flt_~m#1 % 4294967296 || base2flt_~m#1 % 4294967296 == 16777216 * ((128 + base2flt_~e#1) % 4294967296) % 4294967296;base2flt_#t~bitwise5#1 := 16777216 * ((128 + base2flt_~e#1) % 4294967296);" "base2flt_~res~0#1 := base2flt_#t~bitwise5#1;havoc base2flt_#t~bitwise5#1;base2flt_~__retres4~0#1 := base2flt_~res~0#1;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-17 20:03:06,682 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-17 20:03:06,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1173492415, now seen corresponding path program 1 times [2025-03-17 20:03:06,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-03-17 20:03:06,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:03:06,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:03:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:06,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:06,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-03-17 20:03:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111236102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:06,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:03:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163986276] [2025-03-17 20:03:06,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:06,745 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:06,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash 4255, now seen corresponding path program 1 times [2025-03-17 20:03:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-03-17 20:03:06,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,767 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,767 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,767 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,768 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:06,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2025-03-17 20:03:06,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,768 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,829 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:06,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,831 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 20:03:06,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:06,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,858 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:03:06,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:06,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,876 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:06,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:03:06,880 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,880 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:06,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2025-03-17 20:03:06,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,880 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,938 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,939 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,940 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:03:06,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:06,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:06,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 20:03:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,963 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 20:03:06,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:06,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:06,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:06,978 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,980 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:06,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 20:03:06,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:06,982 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:06,982 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:06,982 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-17 20:03:06,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:03:06,988 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:07,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:03:07,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:03:07,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:07,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:07,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:07,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:07,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:07,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:07,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:07,030 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:03:07,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 68 transitions. cyclomatic complexity: 25 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 68 transitions. cyclomatic complexity: 25. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 71 transitions. Complement of second has 4 states. [2025-03-17 20:03:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-17 20:03:07,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-17 20:03:07,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-17 20:03:07,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 17 letters. Loop has 4 letters. [2025-03-17 20:03:07,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 71 transitions. [2025-03-17 20:03:07,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:07,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:03:07,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:03:07,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:03:07,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:07,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:03:07,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:03:07,039 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:07,039 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:07,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:03:07,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:03:07,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:03:07,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:03:07,040 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,040 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:03:07,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:03:07,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:07,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:03:07,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:03:07 BoogieIcfgContainer [2025-03-17 20:03:07,067 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:03:07,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:03:07,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:03:07,068 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:03:07,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:03" (3/4) ... [2025-03-17 20:03:07,069 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:03:07,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:03:07,070 INFO L158 Benchmark]: Toolchain (without parser) took 4773.45ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 108.5MB in the beginning and 248.2MB in the end (delta: -139.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,070 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.43ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 94.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.91ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,071 INFO L158 Benchmark]: Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,071 INFO L158 Benchmark]: IcfgBuilder took 528.17ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 58.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,071 INFO L158 Benchmark]: BuchiAutomizer took 3983.75ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 58.9MB in the beginning and 248.3MB in the end (delta: -189.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,071 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 285.2MB. Free memory was 248.3MB in the beginning and 248.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.43ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 94.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.91ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 528.17ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 58.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3983.75ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 58.9MB in the beginning and 248.3MB in the end (delta: -189.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 285.2MB. Free memory was 248.3MB in the beginning and 248.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (6 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 4 locations. One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * e) + 253) and consists of 3 locations. One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * e) + 253) and consists of 3 locations. One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * e) + 253) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 135 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 591 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 842 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 456 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 696 mSDtfsCounter, 456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp60 ukn100 mio100 lsp100 div616 bol100 ite100 ukn100 eq134 hnf96 smp41 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:03:07,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE