./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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_5a.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 f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:46:27,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:46:27,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:46:27,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:46:27,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:46:27,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:46:27,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:46:27,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:46:27,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:46:27,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:46:27,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:46:27,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:46:27,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:46:27,565 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:46:27,565 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:46:27,565 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:46:27,565 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:46:27,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:46:27,566 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:46:27,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:46:27,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:46:27,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:46:27,567 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:46:27,567 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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2025-03-04 15:46:27,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:46:27,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:46:27,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:46:27,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:46:27,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:46:27,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2025-03-04 15:46:28,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68538e619/184f1d29b64e44669f6dc7d40200222a/FLAG6b8863fd1 [2025-03-04 15:46:29,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:46:29,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2025-03-04 15:46:29,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68538e619/184f1d29b64e44669f6dc7d40200222a/FLAG6b8863fd1 [2025-03-04 15:46:29,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68538e619/184f1d29b64e44669f6dc7d40200222a [2025-03-04 15:46:29,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:46:29,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:46:29,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:46:29,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:46:29,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:46:29,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29, skipping insertion in model container [2025-03-04 15:46:29,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:46:29,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:46:29,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:46:29,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:46:29,712 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:46:29,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29 WrapperNode [2025-03-04 15:46:29,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:46:29,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:46:29,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:46:29,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:46:29,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,752 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 11, calls inlined = 9, statements flattened = 352 [2025-03-04 15:46:29,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:46:29,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:46:29,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:46:29,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:46:29,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,782 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-04 15:46:29,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:46:29,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:46:29,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:46:29,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:46:29,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (1/1) ... [2025-03-04 15:46:29,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:29,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:29,827 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-04 15:46:29,829 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-04 15:46:29,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:46:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:46:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:46:29,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:46:29,894 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:46:29,895 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:46:30,312 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-04 15:46:30,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:46:30,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:46:30,348 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:46:30,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:30 BoogieIcfgContainer [2025-03-04 15:46:30,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:46:30,349 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:46:30,349 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:46:30,354 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:46:30,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:30,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:46:29" (1/3) ... [2025-03-04 15:46:30,355 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@691292e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:46:30, skipping insertion in model container [2025-03-04 15:46:30,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:30,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:29" (2/3) ... [2025-03-04 15:46:30,356 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@691292e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:46:30, skipping insertion in model container [2025-03-04 15:46:30,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:30,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:30" (3/3) ... [2025-03-04 15:46:30,357 INFO L363 chiAutomizerObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2025-03-04 15:46:30,393 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:46:30,393 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:46:30,393 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:46:30,393 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:46:30,393 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:46:30,393 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:46:30,393 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:46:30,393 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:46:30,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 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-04 15:46:30,412 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-03-04 15:46:30,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:30,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:30,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:46:30,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:30,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:46:30,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 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-04 15:46:30,423 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-03-04 15:46:30,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:30,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:30,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:46:30,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:30,430 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_~sb~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_~sb~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-04 15:46:30,431 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:30,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash 8587708, now seen corresponding path program 1 times [2025-03-04 15:46:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183874875] [2025-03-04 15:46:30,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:30,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:46:30,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:46:30,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:30,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:30,596 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-04 15:46:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183874875] [2025-03-04 15:46:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183874875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:30,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485029225] [2025-03-04 15:46:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:30,601 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 259136, now seen corresponding path program 1 times [2025-03-04 15:46:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131675512] [2025-03-04 15:46:30,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:30,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:30,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:30,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:30,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:30,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:30,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:30,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:30,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:30,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:30,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:30,657 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:30,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:30,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:30,658 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:30,658 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:30,658 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:30,658 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:30,658 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:30,658 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration1_Loop [2025-03-04 15:46:30,658 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:30,658 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:30,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:30,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:30,822 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:30,823 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:30,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:30,826 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-04 15:46:30,828 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-04 15:46:30,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:30,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:30,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:46:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:30,849 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-04 15:46:30,851 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-04 15:46:30,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:30,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:30,875 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:30,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:30,882 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:30,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:30,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:30,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:30,882 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:30,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:30,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:30,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:30,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration1_Loop [2025-03-04 15:46:30,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:30,883 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:30,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:30,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:30,993 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:30,997 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:30,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:30,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,000 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-04 15:46:31,001 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-04 15:46:31,002 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-04 15:46:31,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:31,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:31,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:31,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:31,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:31,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:31,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:31,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:31,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:31,027 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:31,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,031 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-04 15:46:31,033 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-04 15:46:31,033 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:31,034 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:31,034 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:31,034 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-04 15:46:31,041 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-04 15:46:31,043 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:31,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:46:31,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:46:31,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:31,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:31,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:31,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:31,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:31,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:31,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:31,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:31,127 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-04 15:46:31,149 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-04 15:46:31,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-04 15:46:31,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 348 states and 544 transitions. Complement of second has 6 states. [2025-03-04 15:46:31,258 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-04 15:46:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-04 15:46:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-03-04 15:46:31,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 360 transitions. Stem has 4 letters. Loop has 3 letters. [2025-03-04 15:46:31,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:31,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 360 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:31,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:31,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 360 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-04 15:46:31,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:31,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 544 transitions. [2025-03-04 15:46:31,279 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2025-03-04 15:46:31,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 122 states and 183 transitions. [2025-03-04 15:46:31,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2025-03-04 15:46:31,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-04 15:46:31,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 183 transitions. [2025-03-04 15:46:31,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:31,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 183 transitions. [2025-03-04 15:46:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 183 transitions. [2025-03-04 15:46:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2025-03-04 15:46:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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-04 15:46:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 159 transitions. [2025-03-04 15:46:31,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 159 transitions. [2025-03-04 15:46:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:31,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:31,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:31,309 INFO L87 Difference]: Start difference. First operand 103 states and 159 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-04 15:46:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:31,386 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2025-03-04 15:46:31,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2025-03-04 15:46:31,387 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-03-04 15:46:31,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 70 transitions. [2025-03-04 15:46:31,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-04 15:46:31,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-04 15:46:31,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 70 transitions. [2025-03-04 15:46:31,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:31,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-04 15:46:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 70 transitions. [2025-03-04 15:46:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 15:46:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 48 states have internal predecessors, (70), 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-04 15:46:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-04 15:46:31,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-04 15:46:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:31,394 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-04 15:46:31,394 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:46:31,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 70 transitions. [2025-03-04 15:46:31,395 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-03-04 15:46:31,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:31,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:31,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:31,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:31,395 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_~sb~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_~sb~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-04 15:46:31,395 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1863390416, now seen corresponding path program 1 times [2025-03-04 15:46:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108913745] [2025-03-04 15:46:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:31,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:31,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:31,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:31,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:31,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:31,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:31,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:31,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 217430, now seen corresponding path program 1 times [2025-03-04 15:46:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760191543] [2025-03-04 15:46:31,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:31,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:31,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:31,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:31,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:31,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:31,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:31,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:31,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 188605383, now seen corresponding path program 1 times [2025-03-04 15:46:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897125547] [2025-03-04 15:46:31,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:31,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:31,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:31,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:31,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:31,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:31,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:31,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:31,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:31,486 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:31,486 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:31,486 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:31,486 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:31,486 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:31,486 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,486 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:31,486 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:31,486 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration2_Loop [2025-03-04 15:46:31,486 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:31,487 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:31,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:31,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:31,578 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:31,578 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,583 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-04 15:46:31,585 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-04 15:46:31,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:31,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:31,606 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:31,606 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-04 15:46:31,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:46:31,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,612 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-04 15:46:31,613 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-04 15:46:31,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:31,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:31,631 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-04 15:46:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,634 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-04 15:46:31,635 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-04 15:46:31,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:31,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:31,662 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:31,666 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-04 15:46:31,666 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:31,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:31,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:31,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:31,666 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:31,666 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,667 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:31,667 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:31,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration2_Loop [2025-03-04 15:46:31,667 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:31,667 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:31,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:31,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:31,759 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:31,759 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:31,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,761 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-04 15:46:31,763 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-04 15:46:31,764 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-04 15:46:31,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:31,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:31,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:31,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:31,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:31,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:31,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:31,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:31,783 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-04 15:46:31,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,785 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-04 15:46:31,786 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-04 15:46:31,788 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-04 15:46:31,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:31,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:31,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:31,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:31,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:31,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:31,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:31,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:31,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:31,803 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:31,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:31,805 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-04 15:46:31,806 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-04 15:46:31,807 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:31,807 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:31,807 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:31,807 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-04 15:46:31,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:31,814 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:31,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:31,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:31,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:46:31,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:31,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:31,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:31,861 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-04 15:46:31,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:31,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:31,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:31,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:31,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:31,888 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-04 15:46:31,889 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-04 15:46:31,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 70 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 15:46:31,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 70 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 96 states and 135 transitions. Complement of second has 5 states. [2025-03-04 15:46:31,928 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-04 15:46:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 15:46:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-04 15:46:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:46:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:31,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 135 transitions. [2025-03-04 15:46:31,930 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2025-03-04 15:46:31,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 89 states and 126 transitions. [2025-03-04 15:46:31,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-03-04 15:46:31,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-03-04 15:46:31,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 126 transitions. [2025-03-04 15:46:31,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:31,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-03-04 15:46:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 126 transitions. [2025-03-04 15:46:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2025-03-04 15:46:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 51 states have internal predecessors, (74), 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-04 15:46:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-04 15:46:31,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 15:46:31,936 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 15:46:31,936 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:46:31,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2025-03-04 15:46:31,936 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-03-04 15:46:31,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:31,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:31,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:31,937 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:31,937 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_~sb~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_~sb~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-04 15:46:31,937 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:31,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1863390415, now seen corresponding path program 1 times [2025-03-04 15:46:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:31,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953273549] [2025-03-04 15:46:31,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:31,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:31,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:31,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:31,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,003 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-04 15:46:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953273549] [2025-03-04 15:46:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953273549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:32,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:46:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695757655] [2025-03-04 15:46:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:32,004 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash 227332, now seen corresponding path program 1 times [2025-03-04 15:46:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-03-04 15:46:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:32,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:32,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:32,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:32,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:32,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:32,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:32,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:32,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:32,037 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:32,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:32,038 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:32,038 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:32,038 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:32,038 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,038 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:32,038 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:32,038 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration3_Loop [2025-03-04 15:46:32,038 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:32,038 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:32,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,114 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:32,116 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:32,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,118 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-04 15:46:32,120 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-04 15:46:32,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:32,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:32,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:46:32,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,147 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-04 15:46:32,148 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-04 15:46:32,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:32,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:32,171 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:32,179 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-04 15:46:32,179 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:32,179 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:32,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:32,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:32,179 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:32,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:32,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:32,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration3_Loop [2025-03-04 15:46:32,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:32,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:32,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,251 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:32,252 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:32,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,253 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-04 15:46:32,255 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-04 15:46:32,256 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-04 15:46:32,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:32,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:32,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:32,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:32,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:32,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:32,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:32,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:32,276 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-04 15:46:32,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,278 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-04 15:46:32,280 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-04 15:46:32,281 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-04 15:46:32,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:32,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:32,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:32,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:32,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:32,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:32,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:32,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:32,294 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:32,294 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:32,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,296 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-04 15:46:32,297 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-04 15:46:32,297 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:32,297 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:32,297 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:32,298 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-04 15:46:32,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:32,304 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:32,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:32,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:32,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:32,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:32,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:32,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:32,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:32,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:32,354 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-04 15:46:32,355 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-04 15:46:32,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 74 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04 15:46:32,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 74 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 98 states and 138 transitions. Complement of second has 5 states. [2025-03-04 15:46:32,383 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-04 15:46:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04 15:46:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 15:46:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:46:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:32,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 138 transitions. [2025-03-04 15:46:32,385 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-03-04 15:46:32,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 91 states and 129 transitions. [2025-03-04 15:46:32,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2025-03-04 15:46:32,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2025-03-04 15:46:32,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 129 transitions. [2025-03-04 15:46:32,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:32,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-04 15:46:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 129 transitions. [2025-03-04 15:46:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2025-03-04 15:46:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 54 states have internal predecessors, (78), 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-04 15:46:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-03-04 15:46:32,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-04 15:46:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:32,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:32,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:32,389 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-04 15:46:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:32,449 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2025-03-04 15:46:32,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2025-03-04 15:46:32,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:32,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2025-03-04 15:46:32,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-04 15:46:32,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-04 15:46:32,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2025-03-04 15:46:32,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:32,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-04 15:46:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2025-03-04 15:46:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-03-04 15:46:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 48 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-04 15:46:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-03-04 15:46:32,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-04 15:46:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:32,454 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-04 15:46:32,454 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:46:32,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 67 transitions. [2025-03-04 15:46:32,454 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:32,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:32,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:32,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:32,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:32,455 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_~sb~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_~sb~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 true;" "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-04 15:46:32,455 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash 923580904, now seen corresponding path program 1 times [2025-03-04 15:46:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016519026] [2025-03-04 15:46:32,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:32,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:32,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:32,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,512 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-04 15:46:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016519026] [2025-03-04 15:46:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016519026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607863842] [2025-03-04 15:46:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:32,512 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:32,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 185626, now seen corresponding path program 1 times [2025-03-04 15:46:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335344160] [2025-03-04 15:46:32,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:32,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:32,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:32,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:32,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:32,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:32,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:32,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:32,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:32,548 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:32,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:32,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:32,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:32,548 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:32,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:32,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:32,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration4_Loop [2025-03-04 15:46:32,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:32,548 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:32,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,619 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:32,619 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:32,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,623 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-04 15:46:32,624 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-04 15:46:32,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:32,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:32,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,643 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-04 15:46:32,644 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-04 15:46:32,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:32,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:32,666 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:32,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:32,670 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:32,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:32,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:32,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:32,670 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:32,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:32,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:32,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration4_Loop [2025-03-04 15:46:32,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:32,670 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:32,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:32,734 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:32,735 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:32,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,737 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-04 15:46:32,738 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-04 15:46:32,739 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-04 15:46:32,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:32,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:32,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:32,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:32,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:32,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:32,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:32,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:32,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:32,753 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:32,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:32,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,754 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-04 15:46:32,755 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-04 15:46:32,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:32,756 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:32,756 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:32,756 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-04 15:46:32,761 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-04 15:46:32,762 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:32,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:32,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:32,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:32,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:32,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:32,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:32,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:32,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:32,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:32,807 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-04 15:46:32,807 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-04 15:46:32,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 67 transitions. cyclomatic complexity: 23 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-04 15:46:32,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:32,836 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-04 15:46:32,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 67 transitions. cyclomatic complexity: 23. 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) Result 77 states and 103 transitions. Complement of second has 5 states. [2025-03-04 15:46:32,856 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-04 15:46:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04 15:46:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 15:46:32,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:46:32,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:32,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-04 15:46:32,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:32,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-04 15:46:32,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:32,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 103 transitions. [2025-03-04 15:46:32,858 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-03-04 15:46:32,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 70 states and 94 transitions. [2025-03-04 15:46:32,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-04 15:46:32,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-04 15:46:32,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 94 transitions. [2025-03-04 15:46:32,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:32,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-03-04 15:46:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 94 transitions. [2025-03-04 15:46:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2025-03-04 15:46:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 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-04 15:46:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2025-03-04 15:46:32,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 71 transitions. [2025-03-04 15:46:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:32,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:32,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:32,863 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. 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-04 15:46:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:32,887 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2025-03-04 15:46:32,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2025-03-04 15:46:32,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-04 15:46:32,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 71 transitions. [2025-03-04 15:46:32,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-03-04 15:46:32,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-04 15:46:32,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2025-03-04 15:46:32,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:32,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-04 15:46:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2025-03-04 15:46:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-04 15:46:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 51 states have internal predecessors, (70), 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-04 15:46:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-03-04 15:46:32,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-03-04 15:46:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:32,892 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-03-04 15:46:32,892 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:46:32,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 70 transitions. [2025-03-04 15:46:32,893 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-04 15:46:32,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:32,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:32,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:32,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:32,893 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_~sb~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_~sb~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 true;" "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 true;" "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-04 15:46:32,893 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2081334590, now seen corresponding path program 1 times [2025-03-04 15:46:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449621447] [2025-03-04 15:46:32,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:32,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:46:32,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:46:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449621447] [2025-03-04 15:46:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449621447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:46:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369830163] [2025-03-04 15:46:32,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:32,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:46:32,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:32,974 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-04 15:46:32,975 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-04 15:46:33,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:46:33,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:46:33,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:33,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:33,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:33,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:46:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369830163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:46:33,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:46:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 15:46:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11018187] [2025-03-04 15:46:33,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:46:33,049 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:33,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 175724, now seen corresponding path program 1 times [2025-03-04 15:46:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649043939] [2025-03-04 15:46:33,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:33,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:33,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:33,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:33,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:33,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:33,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:33,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:33,076 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:33,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:33,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:33,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:33,076 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:33,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:33,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:33,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration5_Loop [2025-03-04 15:46:33,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:33,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:33,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,149 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:33,149 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:33,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,151 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-04 15:46:33,159 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-04 15:46:33,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:33,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:33,178 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:33,178 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-04 15:46:33,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,184 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-04 15:46:33,184 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-04 15:46:33,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:33,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:33,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:33,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,204 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-04 15:46:33,205 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-04 15:46:33,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:33,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:33,227 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:33,230 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-04 15:46:33,231 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:33,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:33,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:33,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:33,231 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:33,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:33,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:33,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration5_Loop [2025-03-04 15:46:33,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:33,231 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:33,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,306 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:33,306 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:33,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,308 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-04 15:46:33,309 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-04 15:46:33,310 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-04 15:46:33,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:33,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:33,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:33,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:33,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:33,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:33,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:33,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:33,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:46:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,334 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-04 15:46:33,335 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-04 15:46:33,335 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-04 15:46:33,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:33,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:33,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:33,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:33,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:33,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:33,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:33,347 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:33,349 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:33,349 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:33,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,351 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-04 15:46:33,352 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-04 15:46:33,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:33,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:33,352 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:33,352 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-04 15:46:33,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:46:33,358 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:33,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:46:33,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:46:33,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:33,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:33,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:33,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:33,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:33,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:33,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:33,423 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-04 15:46:33,424 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-04 15:46:33,424 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 70 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-04 15:46:33,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 70 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 81 states and 107 transitions. Complement of second has 5 states. [2025-03-04 15:46:33,445 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-04 15:46:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-04 15:46:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:46:33,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-04 15:46:33,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:33,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 19 letters. Loop has 3 letters. [2025-03-04 15:46:33,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:33,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-04 15:46:33,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:33,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2025-03-04 15:46:33,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:33,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 74 states and 98 transitions. [2025-03-04 15:46:33,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-03-04 15:46:33,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-03-04 15:46:33,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 98 transitions. [2025-03-04 15:46:33,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:33,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-04 15:46:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 98 transitions. [2025-03-04 15:46:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2025-03-04 15:46:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 54 states have internal predecessors, (74), 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-04 15:46:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2025-03-04 15:46:33,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 74 transitions. [2025-03-04 15:46:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:33,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:46:33,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:46:33,452 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-04 15:46:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:33,502 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2025-03-04 15:46:33,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 126 transitions. [2025-03-04 15:46:33,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:46:33,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 120 transitions. [2025-03-04 15:46:33,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-04 15:46:33,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-04 15:46:33,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 120 transitions. [2025-03-04 15:46:33,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:33,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-03-04 15:46:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 120 transitions. [2025-03-04 15:46:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2025-03-04 15:46:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 62 states have internal predecessors, (85), 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-04 15:46:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2025-03-04 15:46:33,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 85 transitions. [2025-03-04 15:46:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:46:33,509 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 85 transitions. [2025-03-04 15:46:33,509 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:46:33,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 85 transitions. [2025-03-04 15:46:33,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:46:33,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:33,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:33,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:33,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:33,510 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_~sb~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_~sb~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 true;" "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-04 15:46:33,510 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1449650968, now seen corresponding path program 1 times [2025-03-04 15:46:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896459104] [2025-03-04 15:46:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:33,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:46:33,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:46:33,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:33,547 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-04 15:46:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896459104] [2025-03-04 15:46:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896459104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:33,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:33,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235357712] [2025-03-04 15:46:33,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:33,548 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 134018, now seen corresponding path program 1 times [2025-03-04 15:46:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:33,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292488953] [2025-03-04 15:46:33,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:33,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:33,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:33,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:33,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:33,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:33,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:33,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:33,572 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:33,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:33,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:33,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:33,573 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:33,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:33,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:33,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration6_Loop [2025-03-04 15:46:33,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:33,573 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:33,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,637 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:33,637 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,639 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-04 15:46:33,640 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-04 15:46:33,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:33,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:33,655 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:33,655 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-04 15:46:33,658 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-04 15:46:33,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,660 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-04 15:46:33,661 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-04 15:46:33,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:33,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:33,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 15:46:33,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,679 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-04 15:46:33,680 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-04 15:46:33,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:33,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:33,702 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:33,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:46:33,705 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:33,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:33,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:33,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:33,706 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:33,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:33,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:33,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration6_Loop [2025-03-04 15:46:33,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:33,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:33,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:33,763 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-04 15:46:33,791 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:33,791 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:33,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,793 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-04 15:46:33,794 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-04 15:46:33,795 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-04 15:46:33,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:33,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:33,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:33,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:33,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:33,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:33,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:33,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:33,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:46:33,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,815 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-04 15:46:33,816 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-04 15:46:33,817 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-04 15:46:33,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:33,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:33,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:33,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:33,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:33,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:33,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:33,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:33,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:33,830 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:33,832 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-04 15:46:33,834 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-04 15:46:33,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:33,835 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:33,835 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:33,835 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-04 15:46:33,840 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-04 15:46:33,841 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:33,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:46:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:46:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:33,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:33,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:33,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:33,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:33,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:33,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:33,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:33,912 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-04 15:46:33,912 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-04 15:46:33,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 85 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-04 15:46:33,928 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 85 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 67 states and 89 transitions. Complement of second has 4 states. [2025-03-04 15:46:33,928 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-04 15:46:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-04 15:46:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 15:46:33,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 21 letters. Loop has 3 letters. [2025-03-04 15:46:33,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:33,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-04 15:46:33,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:33,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 21 letters. Loop has 6 letters. [2025-03-04 15:46:33,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:33,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2025-03-04 15:46:33,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:33,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 60 states and 81 transitions. [2025-03-04 15:46:33,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-03-04 15:46:33,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-03-04 15:46:33,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2025-03-04 15:46:33,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:33,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-03-04 15:46:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2025-03-04 15:46:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 15:46:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.35) internal successors, (81), 59 states have internal predecessors, (81), 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-04 15:46:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-03-04 15:46:33,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-03-04 15:46:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:33,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:33,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:33,933 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-04 15:46:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:33,980 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2025-03-04 15:46:33,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2025-03-04 15:46:33,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:33,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2025-03-04 15:46:33,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-03-04 15:46:33,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-03-04 15:46:33,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2025-03-04 15:46:33,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:33,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-04 15:46:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2025-03-04 15:46:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2025-03-04 15:46:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 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-04 15:46:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-03-04 15:46:33,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-03-04 15:46:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:33,985 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-03-04 15:46:33,985 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:46:33,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 83 transitions. [2025-03-04 15:46:33,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:33,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:33,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:33,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:33,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:33,986 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_~sb~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_~sb~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 true;" "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-04 15:46:33,986 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash -335286986, now seen corresponding path program 1 times [2025-03-04 15:46:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669789618] [2025-03-04 15:46:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:33,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:46:33,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:46:33,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:33,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:34,050 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-04 15:46:34,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669789618] [2025-03-04 15:46:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669789618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:46:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306023494] [2025-03-04 15:46:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:34,051 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 143920, now seen corresponding path program 1 times [2025-03-04 15:46:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470743875] [2025-03-04 15:46:34,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:34,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:34,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:34,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:34,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:34,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:34,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:34,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:34,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:34,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:34,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:34,077 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:34,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:34,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:34,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:34,077 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:34,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:34,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:34,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration7_Loop [2025-03-04 15:46:34,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:34,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:34,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:34,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:34,135 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:34,135 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:34,138 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-04 15:46:34,140 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-04 15:46:34,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:34,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:34,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:34,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:34,159 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-04 15:46:34,160 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-04 15:46:34,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:34,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:34,178 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:34,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:34,181 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:34,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:34,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:34,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:34,182 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:34,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:34,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:34,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration7_Loop [2025-03-04 15:46:34,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:34,182 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:34,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:34,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:34,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:34,234 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:34,235 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-04 15:46:34,237 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-04 15:46:34,237 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-04 15:46:34,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:34,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:34,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:34,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:34,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:34,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:34,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:34,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:34,256 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-04 15:46:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:34,257 INFO L229 MonitoredProcess]: Starting monitored process 37 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-04 15:46:34,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:46:34,259 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-04 15:46:34,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:34,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:34,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:34,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:34,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:34,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:34,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:34,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:34,271 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:34,271 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:34,273 INFO L229 MonitoredProcess]: Starting monitored process 38 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-04 15:46:34,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:46:34,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:34,277 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:34,277 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:34,277 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-04 15:46:34,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:46:34,283 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:34,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:46:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:46:34,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:34,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:34,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:34,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:34,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:34,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:34,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:34,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:34,346 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-04 15:46:34,346 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-04 15:46:34,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 83 transitions. cyclomatic complexity: 25 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-04 15:46:34,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 83 transitions. cyclomatic complexity: 25. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 87 transitions. Complement of second has 4 states. [2025-03-04 15:46:34,358 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-04 15:46:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-04 15:46:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 15:46:34,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 22 letters. Loop has 3 letters. [2025-03-04 15:46:34,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:34,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-04 15:46:34,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:34,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 22 letters. Loop has 6 letters. [2025-03-04 15:46:34,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:34,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2025-03-04 15:46:34,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:34,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2025-03-04 15:46:34,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:46:34,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:46:34,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:46:34,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:34,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:34,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:46:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:46:34,360 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-04 15:46:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:34,360 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-04 15:46:34,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-04 15:46:34,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:34,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 15:46:34,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:46:34,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:46:34,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:46:34,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:34,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:34,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:46:34,361 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:34,361 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:46:34,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:46:34,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:34,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:46:34,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:46:34 BoogieIcfgContainer [2025-03-04 15:46:34,367 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:46:34,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:46:34,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:46:34,367 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:46:34,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:30" (3/4) ... [2025-03-04 15:46:34,369 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:46:34,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:46:34,370 INFO L158 Benchmark]: Toolchain (without parser) took 4870.79ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 54.4MB in the end (delta: 59.3MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.01ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 100.4MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.46ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: IcfgBuilder took 549.87ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 63.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: BuchiAutomizer took 4017.56ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 54.4MB in the end (delta: 9.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2025-03-04 15:46:34,370 INFO L158 Benchmark]: Witness Printer took 2.14ms. Allocated memory is still 142.6MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:34,371 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.21ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.01ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 100.4MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.46ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 549.87ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 63.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4017.56ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 54.4MB in the end (delta: 9.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Witness Printer took 2.14ms. Allocated memory is still 142.6MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 24.1kB). 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) + 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) + 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:2. Analysis of lassos took 2.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 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, 649 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 642 mSDsluCounter, 1036 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 815 mSDtfsCounter, 383 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: 36ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:46:34,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 15:46:34,583 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-04 15:46:34,785 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-04 15:46:34,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE