./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:40:21,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:40:21,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:40:21,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:40:21,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:40:21,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:40:21,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:40:21,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:40:21,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:40:21,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:40:21,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:40:21,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:40:21,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:40:21,918 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:40:21,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:40:21,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:40:21,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:40:21,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:40:21,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:40:21,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:40:21,920 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:40:21,920 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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2025-03-17 20:40:22,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:40:22,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:40:22,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:40:22,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:40:22,180 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:40:22,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-03-17 20:40:23,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25da87d4/5fce05c1133c4cca91aac96522a7081f/FLAGac9fd5079 [2025-03-17 20:40:23,700 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:40:23,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-03-17 20:40:23,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25da87d4/5fce05c1133c4cca91aac96522a7081f/FLAGac9fd5079 [2025-03-17 20:40:23,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25da87d4/5fce05c1133c4cca91aac96522a7081f [2025-03-17 20:40:23,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:40:23,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:40:23,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:40:23,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:40:23,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:40:23,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:23,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23, skipping insertion in model container [2025-03-17 20:40:23,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:23,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:40:23,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:40:23,932 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:40:23,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:40:23,998 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:40:23,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23 WrapperNode [2025-03-17 20:40:23,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:40:23,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:40:23,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:40:23,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:40:24,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,029 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 418 [2025-03-17 20:40:24,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:40:24,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:40:24,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:40:24,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:40:24,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 20:40:24,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:40:24,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:40:24,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:40:24,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:40:24,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (1/1) ... [2025-03-17 20:40:24,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:24,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:24,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:24,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:40:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:40:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:40:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:40:24,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:40:24,205 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:40:24,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:40:24,552 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-17 20:40:24,552 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:40:24,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:40:24,563 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:40:24,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:40:24 BoogieIcfgContainer [2025-03-17 20:40:24,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:40:24,565 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:40:24,565 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:40:24,568 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:40:24,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:40:24,569 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:40:23" (1/3) ... [2025-03-17 20:40:24,571 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b33df0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:40:24, skipping insertion in model container [2025-03-17 20:40:24,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:40:24,571 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:40:23" (2/3) ... [2025-03-17 20:40:24,572 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b33df0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:40:24, skipping insertion in model container [2025-03-17 20:40:24,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:40:24,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:40:24" (3/3) ... [2025-03-17 20:40:24,573 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-03-17 20:40:24,610 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:40:24,610 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:40:24,610 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:40:24,610 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:40:24,611 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:40:24,611 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:40:24,611 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:40:24,611 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:40:24,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 105 states have (on average 1.8) internal successors, (189), 105 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:24,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:24,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:24,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:24,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:24,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:24,641 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:40:24,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 105 states have (on average 1.8) internal successors, (189), 105 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:24,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:24,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:24,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:24,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:24,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:24,656 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:24,658 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0;" "check_#res#1 := check_~tmp~1#1;main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume 0 == assert_~arg#1 % 256;assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false;" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" [2025-03-17 20:40:24,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1141760972, now seen corresponding path program 1 times [2025-03-17 20:40:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071298912] [2025-03-17 20:40:24,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:24,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:40:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:40:24,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071298912] [2025-03-17 20:40:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071298912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609562762] [2025-03-17 20:40:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,019 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:25,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2009846119, now seen corresponding path program 1 times [2025-03-17 20:40:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520928212] [2025-03-17 20:40:25,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:40:25,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:40:25,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520928212] [2025-03-17 20:40:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520928212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:40:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4487649] [2025-03-17 20:40:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,043 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:25,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 20:40:25,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 20:40:25,077 INFO L87 Difference]: Start difference. First operand has 106 states, 105 states have (on average 1.8) internal successors, (189), 105 states have internal predecessors, (189), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:25,089 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions. [2025-03-17 20:40:25,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 187 transitions. [2025-03-17 20:40:25,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:25,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 104 states and 185 transitions. [2025-03-17 20:40:25,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2025-03-17 20:40:25,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2025-03-17 20:40:25,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 185 transitions. [2025-03-17 20:40:25,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:40:25,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 185 transitions. [2025-03-17 20:40:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 185 transitions. [2025-03-17 20:40:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 20:40:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.7788461538461537) internal successors, (185), 103 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-17 20:40:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 185 transitions. [2025-03-17 20:40:25,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 185 transitions. [2025-03-17 20:40:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:40:25,141 INFO L432 stractBuchiCegarLoop]: Abstraction has 104 states and 185 transitions. [2025-03-17 20:40:25,145 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:40:25,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 185 transitions. [2025-03-17 20:40:25,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:25,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:25,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:25,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,147 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:25,149 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0;" "check_#res#1 := check_~tmp~1#1;main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" [2025-03-17 20:40:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1141760972, now seen corresponding path program 2 times [2025-03-17 20:40:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467423903] [2025-03-17 20:40:25,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:40:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:40:25,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:40:25,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:40:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467423903] [2025-03-17 20:40:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467423903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541207676] [2025-03-17 20:40:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,416 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:25,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2009846088, now seen corresponding path program 1 times [2025-03-17 20:40:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-03-17 20:40:25,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:40:25,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:40:25,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:25,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-03-17 20:40:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042274354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816176217] [2025-03-17 20:40:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,538 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:25,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:40:25,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:40:25,539 INFO L87 Difference]: Start difference. First operand 104 states and 185 transitions. cyclomatic complexity: 82 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:25,571 INFO L93 Difference]: Finished difference Result 106 states and 186 transitions. [2025-03-17 20:40:25,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 186 transitions. [2025-03-17 20:40:25,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:25,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 104 states and 177 transitions. [2025-03-17 20:40:25,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2025-03-17 20:40:25,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2025-03-17 20:40:25,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 177 transitions. [2025-03-17 20:40:25,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:40:25,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 177 transitions. [2025-03-17 20:40:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 177 transitions. [2025-03-17 20:40:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 20:40:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.7019230769230769) internal successors, (177), 103 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 177 transitions. [2025-03-17 20:40:25,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 177 transitions. [2025-03-17 20:40:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:40:25,579 INFO L432 stractBuchiCegarLoop]: Abstraction has 104 states and 177 transitions. [2025-03-17 20:40:25,579 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:40:25,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 177 transitions. [2025-03-17 20:40:25,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:25,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:25,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:25,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,580 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0;" "init_#res#1 := init_~tmp___5~0#1;main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:25,581 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" [2025-03-17 20:40:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1141760972, now seen corresponding path program 3 times [2025-03-17 20:40:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679199453] [2025-03-17 20:40:25,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:40:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:40:25,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:40:25,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:40:25,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679199453] [2025-03-17 20:40:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679199453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:40:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709344693] [2025-03-17 20:40:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,685 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:40:25,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1947532348, now seen corresponding path program 1 times [2025-03-17 20:40:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196647196] [2025-03-17 20:40:25,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:40:25,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:40:25,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:25,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196647196] [2025-03-17 20:40:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196647196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026187275] [2025-03-17 20:40:25,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,709 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:25,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:40:25,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:40:25,710 INFO L87 Difference]: Start difference. First operand 104 states and 177 transitions. cyclomatic complexity: 74 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:25,769 INFO L93 Difference]: Finished difference Result 161 states and 267 transitions. [2025-03-17 20:40:25,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 267 transitions. [2025-03-17 20:40:25,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:25,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 159 states and 245 transitions. [2025-03-17 20:40:25,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2025-03-17 20:40:25,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2025-03-17 20:40:25,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 245 transitions. [2025-03-17 20:40:25,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:40:25,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 245 transitions. [2025-03-17 20:40:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 245 transitions. [2025-03-17 20:40:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2025-03-17 20:40:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.5) internal successors, (156), 103 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2025-03-17 20:40:25,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 156 transitions. [2025-03-17 20:40:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:40:25,780 INFO L432 stractBuchiCegarLoop]: Abstraction has 104 states and 156 transitions. [2025-03-17 20:40:25,780 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:40:25,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 156 transitions. [2025-03-17 20:40:25,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2025-03-17 20:40:25,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:25,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:25,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,782 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;" "assume ~id1~0 >= 0;" "assume ~id2~0 >= 0;" "assume ~id3~0 >= 0;" "assume 0 == ~r1~0;" "assume 0 == ~r2~0;" "assume 0 == ~r3~0;" "assume ~max1~0 == ~id1~0;" "assume ~max2~0 == ~id2~0;" "assume ~max3~0 == ~id3~0;" "assume 0 == ~st1~0;" "assume 0 == ~st2~0;" "assume 0 == ~st3~0;" "assume 0 == ~nl1~0;" "assume 0 == ~nl2~0;" "assume 0 == ~nl3~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1;" "init_#res#1 := init_~tmp___5~0#1;main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:25,783 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;" "assume ~r1~0 >= 2;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" [2025-03-17 20:40:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 776156448, now seen corresponding path program 1 times [2025-03-17 20:40:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052364276] [2025-03-17 20:40:25,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:40:25,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:40:25,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:25,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:25,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:25,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:40:25,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:40:25,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:25,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:25,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:25,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1947532348, now seen corresponding path program 2 times [2025-03-17 20:40:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146025567] [2025-03-17 20:40:25,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:40:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:40:25,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:40:25,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:40:25,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:25,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146025567] [2025-03-17 20:40:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146025567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963123948] [2025-03-17 20:40:25,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:25,926 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:40:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:40:25,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:40:25,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:40:25,926 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-17 20:40:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:40:25,968 INFO L93 Difference]: Finished difference Result 147 states and 220 transitions. [2025-03-17 20:40:25,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 220 transitions. [2025-03-17 20:40:25,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2025-03-17 20:40:25,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 220 transitions. [2025-03-17 20:40:25,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2025-03-17 20:40:25,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2025-03-17 20:40:25,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 220 transitions. [2025-03-17 20:40:25,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:40:25,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 220 transitions. [2025-03-17 20:40:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 220 transitions. [2025-03-17 20:40:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-17 20:40:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.4965986394557824) internal successors, (220), 146 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:40:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2025-03-17 20:40:25,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 220 transitions. [2025-03-17 20:40:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:40:25,982 INFO L432 stractBuchiCegarLoop]: Abstraction has 147 states and 220 transitions. [2025-03-17 20:40:25,982 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:40:25,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 220 transitions. [2025-03-17 20:40:25,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2025-03-17 20:40:25,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:40:25,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:40:25,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:40:25,984 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);" "assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1;" "init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1;" "init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1;" "init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1;" "init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1;" "init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1);" "assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1;" "init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;" "assume ~id1~0 >= 0;" "assume ~id2~0 >= 0;" "assume ~id3~0 >= 0;" "assume 0 == ~r1~0;" "assume 0 == ~r2~0;" "assume 0 == ~r3~0;" "assume ~max1~0 == ~id1~0;" "assume ~max2~0 == ~id2~0;" "assume ~max3~0 == ~id3~0;" "assume 0 == ~st1~0;" "assume 0 == ~st2~0;" "assume 0 == ~st3~0;" "assume 0 == ~nl1~0;" "assume 0 == ~nl2~0;" "assume 0 == ~nl3~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1;" "init_#res#1 := init_~tmp___5~0#1;main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;" "assume !(0 == main_~i2~0#1);" "~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-03-17 20:40:25,984 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;assume { :begin_inline_node1 } true;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 2;" "assume 0 != ~ep12~0 % 256;~p12_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 - 256);" "assume 0 != ~ep13~0 % 256;~p13_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 - 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;" [2025-03-17 20:40:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 776156448, now seen corresponding path program 2 times [2025-03-17 20:40:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-03-17 20:40:25,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:40:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:25,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:40:26,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:40:26,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:40:26,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:26,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:26,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:40:26,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:40:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:26,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:26,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1031331553, now seen corresponding path program 1 times [2025-03-17 20:40:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125326448] [2025-03-17 20:40:26,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:26,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:40:26,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:40:26,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:26,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:26,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:40:26,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:40:26,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:40:26,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:26,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:40:26,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:40:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:40:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1229291966, now seen corresponding path program 1 times [2025-03-17 20:40:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:40:26,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661003697] [2025-03-17 20:40:26,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:40:26,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:40:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 20:40:26,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 20:40:26,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:40:26,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:40:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:40:26,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:40:26,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661003697] [2025-03-17 20:40:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661003697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:40:26,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:40:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:40:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487823655] [2025-03-17 20:40:26,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:40:27,533 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:27,534 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:27,534 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:27,534 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:27,534 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:40:27,534 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:27,534 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:27,534 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:27,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration5_Loop [2025-03-17 20:40:27,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:27,535 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:27,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:27,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:28,661 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2025-03-17 20:40:28,769 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 6032 conjunctions. This might take some time... [2025-03-17 20:40:29,440 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions. [2025-03-17 20:40:47,990 WARN L286 SmtUtils]: Spent 18.49s on a formula simplification. DAG size of input: 825 DAG size of output: 136 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-03-17 20:40:48,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:40:48,036 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:40:48,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:48,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:48,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:48,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:40:48,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:48,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:48,067 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:40:48,067 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-108} Honda state: {~ep12~0=-108} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:40:48,074 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-17 20:40:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:48,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:48,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:40:48,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:40:48,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:48,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 20:40:48,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:48,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:40:48,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:40:48,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:40:48,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:40:48,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:40:48,183 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:40:48,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:40:48,188 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:40:48,188 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:40:48,188 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:40:48,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:40:48,188 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:40:48,188 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:40:48,188 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:40:48,188 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:40:48,188 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration5_Loop [2025-03-17 20:40:48,188 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:40:48,188 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:40:48,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:48,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:40:49,006 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2025-03-17 20:40:49,068 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 5958 conjunctions. This might take some time... [2025-03-17 20:40:49,799 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions. [2025-03-17 20:41:08,313 WARN L286 SmtUtils]: Spent 18.44s on a formula simplification. DAG size of input: 825 DAG size of output: 136 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-03-17 20:41:08,343 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:41:08,346 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:41:08,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,348 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:41:08,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 20:41:08,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:41:08,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:41:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:41:08,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 20:41:08,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:41:08,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:41:08,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:41:08,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:41:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,489 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:41:08,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,511 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-17 20:41:08,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:41:08,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,533 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-17 20:41:08,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:41:08,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,553 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-17 20:41:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,554 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:41:08,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:41:08,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:41:08,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,587 INFO L204 nArgumentSynthesizer]: 34 loop disjuncts [2025-03-17 20:41:08,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,721 INFO L401 nArgumentSynthesizer]: We have 68 Motzkin's Theorem applications. [2025-03-17 20:41:08,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 20:41:08,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:41:08,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:41:08,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:41:08,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,892 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:41:08,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:41:08,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:41:08,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:41:08,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:41:08,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:41:08,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:41:08,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:41:08,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:41:08,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:41:08,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:41:08,915 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:41:08,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:41:08,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:41:08,929 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:41:08,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:41:08,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:41:08,931 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:41:08,931 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:41:08,931 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2025-03-17 20:41:08,936 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-17 20:41:08,938 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:41:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:41:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:41:08,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:41:08,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:41:08,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:41:08,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:41:08,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:41:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:41:09,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:41:09,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:41:09,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:41:09,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:41:09,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:41:09,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-17 20:41:09,131 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:41:09,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 220 transitions. cyclomatic complexity: 74 Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:41:09,172 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 220 transitions. cyclomatic complexity: 74. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 244 states and 373 transitions. Complement of second has 4 states. [2025-03-17 20:41:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:41:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:41:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-17 20:41:09,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 156 transitions. Stem has 37 letters. Loop has 28 letters. [2025-03-17 20:41:09,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:41:09,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 156 transitions. Stem has 65 letters. Loop has 28 letters. [2025-03-17 20:41:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:41:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 156 transitions. Stem has 37 letters. Loop has 56 letters. [2025-03-17 20:41:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:41:09,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 373 transitions. [2025-03-17 20:41:09,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:41:09,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 0 states and 0 transitions. [2025-03-17 20:41:09,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:41:09,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:41:09,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:41:09,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:41:09,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:41:09,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:41:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:41:09,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:41:09,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:41:09,180 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:41:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:41:09,180 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:41:09,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:41:09,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:41:09,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:41:09,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:41:09,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:41:09,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:41:09,180 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:41:09,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:41:09,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:41:09 BoogieIcfgContainer [2025-03-17 20:41:09,185 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:41:09,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:41:09,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:41:09,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:41:09,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:40:24" (3/4) ... [2025-03-17 20:41:09,187 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:41:09,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:41:09,188 INFO L158 Benchmark]: Toolchain (without parser) took 45455.86ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 113.3MB in the beginning and 250.6MB in the end (delta: -137.3MB). Peak memory consumption was 174.1MB. Max. memory is 16.1GB. [2025-03-17 20:41:09,188 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:41:09,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.99ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 97.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:41:09,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.70ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:41:09,189 INFO L158 Benchmark]: Boogie Preprocessor took 42.42ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:41:09,190 INFO L158 Benchmark]: IcfgBuilder took 490.88ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 60.1MB in the end (delta: 32.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 20:41:09,190 INFO L158 Benchmark]: BuchiAutomizer took 44620.44ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 60.1MB in the beginning and 250.7MB in the end (delta: -190.6MB). Peak memory consumption was 123.8MB. Max. memory is 16.1GB. [2025-03-17 20:41:09,190 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 453.0MB. Free memory was 250.7MB in the beginning and 250.6MB in the end (delta: 143.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:41:09,191 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.99ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 97.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.70ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.42ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 490.88ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 60.1MB in the end (delta: 32.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 44620.44ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 60.1MB in the beginning and 250.7MB in the end (delta: -190.6MB). Peak memory consumption was 123.8MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 453.0MB. Free memory was 250.7MB in the beginning and 250.6MB in the end (delta: 143.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 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 44.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 55 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 1755 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 901 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 854 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI3 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital299 mio100 ax100 hnf100 lsp395 ukn22 mio100 lsp100 div116 bol100 ite100 ukn100 eq171 hnf97 smp81 dnf26744 smp4 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 285ms VariablesStem: 0 VariablesLoop: 26 DisjunctsStem: 1 DisjunctsLoop: 34 SupportingInvariants: 0 MotzkinApplications: 68 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:41:09,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:41:09,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE