./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 153b6d90c91de27e09ed3c918b0b1be779b258e790f6fc392e7d5f390719c2db --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:03:15,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:03:16,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:03:16,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:03:16,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:03:16,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:03:16,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:03:16,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:03:16,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:03:16,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:03:16,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:03:16,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:03:16,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:03:16,033 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:03:16,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:03:16,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:03:16,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:03:16,035 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:03:16,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:03:16,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:03:16,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:03:16,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:03:16,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:03:16,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:03:16,035 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:03:16,035 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 -> 153b6d90c91de27e09ed3c918b0b1be779b258e790f6fc392e7d5f390719c2db [2025-03-17 20:03:16,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:03:16,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:03:16,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:03:16,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:03:16,254 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:03:16,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c [2025-03-17 20:03:17,378 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6a5ba12/736430f97c414e3faf63182da1053b46/FLAGdadfeefc7 [2025-03-17 20:03:17,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:03:17,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c [2025-03-17 20:03:17,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6a5ba12/736430f97c414e3faf63182da1053b46/FLAGdadfeefc7 [2025-03-17 20:03:17,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6a5ba12/736430f97c414e3faf63182da1053b46 [2025-03-17 20:03:17,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:03:17,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:03:17,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:17,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:03:17,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:03:17,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e36df48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17, skipping insertion in model container [2025-03-17 20:03:17,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:03:17,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:17,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:03:17,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:17,736 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:03:17,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17 WrapperNode [2025-03-17 20:03:17,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:17,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:17,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:03:17,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:03:17,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,755 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-17 20:03:17,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:17,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:03:17,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:03:17,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:03:17,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 20:03:17,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:03:17,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:03:17,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:03:17,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:03:17,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (1/1) ... [2025-03-17 20:03:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:17,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:17,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:03:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:03:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:03:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:03:17,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:03:17,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:03:17,846 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:03:17,952 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 20:03:17,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:03:17,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:03:17,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:03:17,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:17 BoogieIcfgContainer [2025-03-17 20:03:17,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:03:17,960 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:03:17,960 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:03:17,964 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:03:17,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:17,964 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:03:17" (1/3) ... [2025-03-17 20:03:17,966 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b513126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:17, skipping insertion in model container [2025-03-17 20:03:17,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:17,966 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:17" (2/3) ... [2025-03-17 20:03:17,966 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b513126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:17, skipping insertion in model container [2025-03-17 20:03:17,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:17,966 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:17" (3/3) ... [2025-03-17 20:03:17,967 INFO L363 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2025-03-17 20:03:17,997 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:03:17,997 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:03:17,997 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:03:17,997 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:03:17,997 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:03:17,997 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:03:17,997 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:03:17,998 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:03:18,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:18,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-17 20:03:18,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:18,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:18,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:03:18,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:03:18,012 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:03:18,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:18,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-17 20:03:18,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:18,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:18,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:03:18,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:03:18,018 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" [2025-03-17 20:03:18,018 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512;" [2025-03-17 20:03:18,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2025-03-17 20:03:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132569266] [2025-03-17 20:03:18,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:18,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:03:18,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:03:18,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:18,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:03:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:03:18,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:18,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2335324, now seen corresponding path program 1 times [2025-03-17 20:03:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:18,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69074845] [2025-03-17 20:03:18,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:18,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:18,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:18,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:18,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:18,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:18,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:18,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:18,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 74369962, now seen corresponding path program 1 times [2025-03-17 20:03:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676201092] [2025-03-17 20:03:18,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:18,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:18,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:18,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:18,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:18,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:18,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:18,235 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:18,236 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:18,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:18,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:18,236 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:18,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:18,236 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:18,236 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration1_Loop [2025-03-17 20:03:18,236 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:18,237 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:18,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,321 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:18,321 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:18,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:03:18,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:18,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,342 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:18,342 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0#1=0} Honda state: {ULTIMATE.start_main_~s__hit~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:18,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:03:18,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:18,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 20:03:18,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:03:18,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:18,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,386 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:18,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:03:18,393 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:18,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:18,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:18,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:18,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:18,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:18,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:18,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration1_Loop [2025-03-17 20:03:18,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:18,393 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:18,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,451 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:18,453 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:18,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:03:18,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:18,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:18,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:18,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:18,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:18,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:18,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:18,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:18,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:18,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 20:03:18,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:03:18,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:18,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:18,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:18,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:18,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:18,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:18,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:18,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:18,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:18,502 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:18,504 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:18,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:03:18,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:18,510 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:18,510 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:18,510 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0#1) = -1*ULTIMATE.start_main_~blastFlag~0#1 + 1 Supporting invariants [] [2025-03-17 20:03:18,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 20:03:18,518 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:18,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:03:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:03:18,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:18,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:18,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:18,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:18,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:18,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:18,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:18,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:18,617 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:18,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:18,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 79 transitions. Complement of second has 6 states. [2025-03-17 20:03:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-03-17 20:03:18,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 20:03:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:03:18,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:18,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 8 letters. [2025-03-17 20:03:18,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:18,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 79 transitions. [2025-03-17 20:03:18,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-17 20:03:18,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 35 states and 57 transitions. [2025-03-17 20:03:18,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-17 20:03:18,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 20:03:18,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 57 transitions. [2025-03-17 20:03:18,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:18,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 57 transitions. [2025-03-17 20:03:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 57 transitions. [2025-03-17 20:03:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-17 20:03:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2025-03-17 20:03:18,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 54 transitions. [2025-03-17 20:03:18,719 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 54 transitions. [2025-03-17 20:03:18,719 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:03:18,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 54 transitions. [2025-03-17 20:03:18,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-17 20:03:18,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:18,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:18,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:03:18,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:03:18,720 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" [2025-03-17 20:03:18,720 INFO L754 eck$LassoCheckResult]: Loop: "assume 8466 == main_~s__state~0#1;" "assume !(0 == main_~blastFlag~0#1);" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" [2025-03-17 20:03:18,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2495, now seen corresponding path program 1 times [2025-03-17 20:03:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440540696] [2025-03-17 20:03:18,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:18,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:18,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:18,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:18,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:18,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:18,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2208455, now seen corresponding path program 1 times [2025-03-17 20:03:18,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:03:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927083160] [2025-03-17 20:03:18,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:18,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:18,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:18,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:18,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:18,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:18,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1989497467, now seen corresponding path program 1 times [2025-03-17 20:03:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183001105] [2025-03-17 20:03:18,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:18,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:03:18,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:03:18,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:18,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:18,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183001105] [2025-03-17 20:03:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183001105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815639962] [2025-03-17 20:03:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:18,828 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:18,828 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:18,828 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:18,828 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:18,828 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:18,828 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,828 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:18,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:18,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration2_Loop [2025-03-17 20:03:18,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:18,829 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:18,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,883 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:18,883 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:18,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:03:18,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:18,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,906 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:18,906 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0#1=-1} Honda state: {ULTIMATE.start_main_~blastFlag~0#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:18,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 20:03:18,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,915 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:03:18,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:18,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,929 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:18,929 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0#1=0} Honda state: {ULTIMATE.start_main_~s__hit~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:18,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:18,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,937 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:03:18,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:18,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,957 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:03:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:18,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:18,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:03:18,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:18,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:18,975 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:18,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:18,981 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:18,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:18,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:18,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:18,981 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:18,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:18,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:18,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:18,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration2_Loop [2025-03-17 20:03:18,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:18,981 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:18,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:18,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,033 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:19,033 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:19,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,035 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:03:19,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:19,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:19,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:19,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:19,047 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:03:19,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:19,048 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:03:19,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:19,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:19,056 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:03:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:03:19,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:19,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:19,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:19,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:19,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:19,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:19,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:19,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:19,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:19,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:19,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,080 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:03:19,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:19,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:19,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:19,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:19,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:19,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:19,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:19,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:19,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:19,096 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:19,096 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:19,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,098 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:03:19,099 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:19,099 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:19,099 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:19,099 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = -1*ULTIMATE.start_main_~s__state~0#1 + 8489 Supporting invariants [] [2025-03-17 20:03:19,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:03:19,106 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:19,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:19,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:19,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:19,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:19,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:19,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:19,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:19,156 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:03:19,157 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 54 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,181 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 54 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 66 states and 107 transitions. Complement of second has 7 states. [2025-03-17 20:03:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-17 20:03:19,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-17 20:03:19,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-17 20:03:19,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-17 20:03:19,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 107 transitions. [2025-03-17 20:03:19,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-17 20:03:19,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 54 states and 91 transitions. [2025-03-17 20:03:19,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:03:19,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:03:19,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 91 transitions. [2025-03-17 20:03:19,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:19,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 91 transitions. [2025-03-17 20:03:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 91 transitions. [2025-03-17 20:03:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-03-17 20:03:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 46 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2025-03-17 20:03:19,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 79 transitions. [2025-03-17 20:03:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:19,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:19,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:19,194 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:19,222 INFO L93 Difference]: Finished difference Result 77 states and 115 transitions. [2025-03-17 20:03:19,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 115 transitions. [2025-03-17 20:03:19,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2025-03-17 20:03:19,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 75 states and 113 transitions. [2025-03-17 20:03:19,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-17 20:03:19,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-17 20:03:19,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 113 transitions. [2025-03-17 20:03:19,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:19,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-03-17 20:03:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 113 transitions. [2025-03-17 20:03:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 20:03:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 73 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2025-03-17 20:03:19,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-03-17 20:03:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:19,230 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-03-17 20:03:19,230 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:03:19,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 112 transitions. [2025-03-17 20:03:19,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2025-03-17 20:03:19,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:19,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:19,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:03:19,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:19,234 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" [2025-03-17 20:03:19,234 INFO L754 eck$LassoCheckResult]: Loop: "assume !(8466 == main_~s__state~0#1);" "assume 8512 == main_~s__state~0#1;" "havoc main_#t~nondet5#1;main_~tmp___1~0#1 := main_#t~nondet5#1;" "assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" [2025-03-17 20:03:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2495, now seen corresponding path program 2 times [2025-03-17 20:03:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777278707] [2025-03-17 20:03:19,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:03:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:19,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:19,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:19,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:03:19,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:19,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:19,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:19,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash 69560946, now seen corresponding path program 1 times [2025-03-17 20:03:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:19,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528622390] [2025-03-17 20:03:19,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:19,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:19,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:19,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:19,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:19,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1543780492, now seen corresponding path program 1 times [2025-03-17 20:03:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267270880] [2025-03-17 20:03:19,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:19,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:19,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267270880] [2025-03-17 20:03:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267270880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913458896] [2025-03-17 20:03:19,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:19,307 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:19,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:19,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:19,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:19,308 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:19,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,308 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:19,308 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:19,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration3_Loop [2025-03-17 20:03:19,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:19,308 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:19,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,337 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:19,337 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,339 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:03:19,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:19,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:19,354 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:19,354 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~tmp___1~0#1=0} Honda state: {ULTIMATE.start_main_~tmp___1~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:19,360 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:03:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,362 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:03:19,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:19,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:19,382 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:19,382 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0#1=2} Honda state: {ULTIMATE.start_main_~blastFlag~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:19,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:03:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:03:19,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:19,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:19,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:03:19,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,409 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:03:19,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:19,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:19,425 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:19,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 20:03:19,431 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:19,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:19,431 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:19,431 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:19,432 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:19,432 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,432 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:19,432 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:19,432 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration3_Loop [2025-03-17 20:03:19,432 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:19,432 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:19,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,459 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:19,460 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:19,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,462 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:03:19,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:19,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:19,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:19,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:19,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:19,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:19,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:19,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:19,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:19,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:03:19,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,483 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 20:03:19,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:19,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:19,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:19,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:19,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:19,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:19,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:19,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:19,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:19,500 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:19,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:03:19,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,502 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:03:19,505 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:19,505 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:19,505 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:19,505 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = 1*ULTIMATE.start_main_~s__state~0#1 Supporting invariants [] [2025-03-17 20:03:19,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:03:19,511 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:19,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:19,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:19,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:19,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:19,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:19,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:19,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:19,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:19,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:03:19,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 112 transitions. cyclomatic complexity: 44 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 112 transitions. cyclomatic complexity: 44. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 224 states and 343 transitions. Complement of second has 9 states. [2025-03-17 20:03:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-03-17 20:03:19,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 5 letters. [2025-03-17 20:03:19,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 7 letters. Loop has 5 letters. [2025-03-17 20:03:19,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 10 letters. [2025-03-17 20:03:19,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 343 transitions. [2025-03-17 20:03:19,630 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2025-03-17 20:03:19,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 224 states and 343 transitions. [2025-03-17 20:03:19,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-03-17 20:03:19,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-17 20:03:19,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 343 transitions. [2025-03-17 20:03:19,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:19,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 343 transitions. [2025-03-17 20:03:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 343 transitions. [2025-03-17 20:03:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 176. [2025-03-17 20:03:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 175 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2025-03-17 20:03:19,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 266 transitions. [2025-03-17 20:03:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:19,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:19,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:19,640 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:19,657 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2025-03-17 20:03:19,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 81 transitions. [2025-03-17 20:03:19,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-17 20:03:19,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 51 states and 80 transitions. [2025-03-17 20:03:19,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-17 20:03:19,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-17 20:03:19,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 80 transitions. [2025-03-17 20:03:19,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:19,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 80 transitions. [2025-03-17 20:03:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 80 transitions. [2025-03-17 20:03:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 20:03:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 50 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 80 transitions. [2025-03-17 20:03:19,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 80 transitions. [2025-03-17 20:03:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:19,663 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 80 transitions. [2025-03-17 20:03:19,663 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:03:19,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 80 transitions. [2025-03-17 20:03:19,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-17 20:03:19,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:19,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:19,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-17 20:03:19,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:19,664 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" [2025-03-17 20:03:19,664 INFO L754 eck$LassoCheckResult]: Loop: "assume 8512 == main_~s__state~0#1;" "havoc main_#t~nondet5#1;main_~tmp___1~0#1 := main_#t~nondet5#1;" "assume !(0 != main_~tmp___1~0#1);main_~s__state~0#1 := 8640;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" [2025-03-17 20:03:19,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1544910042, now seen corresponding path program 1 times [2025-03-17 20:03:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237086943] [2025-03-17 20:03:19,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:19,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:19,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:19,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:19,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 66462307, now seen corresponding path program 1 times [2025-03-17 20:03:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805219011] [2025-03-17 20:03:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:19,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:19,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:19,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:19,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:19,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:19,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1290942882, now seen corresponding path program 1 times [2025-03-17 20:03:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264438316] [2025-03-17 20:03:19,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:19,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:03:19,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:03:19,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264438316] [2025-03-17 20:03:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264438316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:03:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671419567] [2025-03-17 20:03:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:19,743 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:19,743 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:19,743 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:19,744 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:19,744 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:19,744 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,744 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:19,744 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:19,744 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration4_Loop [2025-03-17 20:03:19,744 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:19,744 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:19,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,759 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:19,759 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,761 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 20:03:19,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:19,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:19,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:03:19,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,787 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 20:03:19,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:19,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:19,801 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:19,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:03:19,808 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:19,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:19,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:19,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:19,808 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:19,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:19,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:19,808 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration4_Loop [2025-03-17 20:03:19,808 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:19,808 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:19,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:19,848 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:19,848 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:19,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:19,853 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:03:19,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:19,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:03:19,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:19,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:19,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:19,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:19,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:19,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:19,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:19,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:19,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:19,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:19,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:19,877 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:19,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:03:19,880 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:19,880 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:19,880 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:19,880 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = -1*ULTIMATE.start_main_~s__state~0#1 + 8576 Supporting invariants [] [2025-03-17 20:03:19,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:19,887 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:19,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:19,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:19,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:19,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:19,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:19,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:19,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:19,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:19,939 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:03:19,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 80 transitions. cyclomatic complexity: 33 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 80 transitions. cyclomatic complexity: 33. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 145 states and 222 transitions. Complement of second has 9 states. [2025-03-17 20:03:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-03-17 20:03:19,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 7 letters. Loop has 5 letters. [2025-03-17 20:03:19,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 12 letters. Loop has 5 letters. [2025-03-17 20:03:19,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 7 letters. Loop has 10 letters. [2025-03-17 20:03:19,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:19,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 222 transitions. [2025-03-17 20:03:19,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2025-03-17 20:03:19,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 125 states and 194 transitions. [2025-03-17 20:03:19,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-17 20:03:19,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 20:03:19,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 194 transitions. [2025-03-17 20:03:19,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:19,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 194 transitions. [2025-03-17 20:03:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 194 transitions. [2025-03-17 20:03:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-03-17 20:03:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.5546218487394958) internal successors, (185), 118 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:03:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 185 transitions. [2025-03-17 20:03:20,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 185 transitions. [2025-03-17 20:03:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:20,003 INFO L87 Difference]: Start difference. First operand 119 states and 185 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:20,030 INFO L93 Difference]: Finished difference Result 148 states and 215 transitions. [2025-03-17 20:03:20,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 215 transitions. [2025-03-17 20:03:20,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2025-03-17 20:03:20,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 142 states and 207 transitions. [2025-03-17 20:03:20,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-17 20:03:20,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-17 20:03:20,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 207 transitions. [2025-03-17 20:03:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 207 transitions. [2025-03-17 20:03:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 207 transitions. [2025-03-17 20:03:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2025-03-17 20:03:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.5163934426229508) internal successors, (185), 121 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:03:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 185 transitions. [2025-03-17 20:03:20,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-03-17 20:03:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:20,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 122 states and 185 transitions. [2025-03-17 20:03:20,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:03:20,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 185 transitions. [2025-03-17 20:03:20,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2025-03-17 20:03:20,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:20,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:20,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:20,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,038 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,038 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume !(8640 == main_~s__state~0#1);" "assume 8656 == main_~s__state~0#1;" "assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3;" "assume 4 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 5;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume !(0 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash 74369961, now seen corresponding path program 1 times [2025-03-17 20:03:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122901477] [2025-03-17 20:03:20,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1941224224, now seen corresponding path program 1 times [2025-03-17 20:03:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135571217] [2025-03-17 20:03:20,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:03:20,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:03:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135571217] [2025-03-17 20:03:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135571217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:20,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:03:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811426315] [2025-03-17 20:03:20,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:20,072 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:03:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:20,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:20,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:20,072 INFO L87 Difference]: Start difference. First operand 122 states and 185 transitions. cyclomatic complexity: 71 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:20,093 INFO L93 Difference]: Finished difference Result 164 states and 240 transitions. [2025-03-17 20:03:20,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 240 transitions. [2025-03-17 20:03:20,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2025-03-17 20:03:20,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 164 states and 240 transitions. [2025-03-17 20:03:20,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-03-17 20:03:20,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-03-17 20:03:20,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 240 transitions. [2025-03-17 20:03:20,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 240 transitions. [2025-03-17 20:03:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 240 transitions. [2025-03-17 20:03:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-17 20:03:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.4634146341463414) internal successors, (240), 163 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2025-03-17 20:03:20,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 240 transitions. [2025-03-17 20:03:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:20,110 INFO L432 stractBuchiCegarLoop]: Abstraction has 164 states and 240 transitions. [2025-03-17 20:03:20,110 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:03:20,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 240 transitions. [2025-03-17 20:03:20,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2025-03-17 20:03:20,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:20,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:20,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:20,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,111 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,111 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume !(8640 == main_~s__state~0#1);" "assume 8656 == main_~s__state~0#1;" "assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3;" "assume !(4 == main_~blastFlag~0#1);" "assume !(5 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume !(0 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash 74369961, now seen corresponding path program 2 times [2025-03-17 20:03:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181308674] [2025-03-17 20:03:20,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:03:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:03:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash -557888646, now seen corresponding path program 1 times [2025-03-17 20:03:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806809478] [2025-03-17 20:03:20,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:03:20,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:03:20,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806809478] [2025-03-17 20:03:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806809478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:03:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165427588] [2025-03-17 20:03:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:20,147 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:03:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:20,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:20,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:20,147 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:20,163 INFO L93 Difference]: Finished difference Result 143 states and 192 transitions. [2025-03-17 20:03:20,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 192 transitions. [2025-03-17 20:03:20,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-03-17 20:03:20,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 98 states and 130 transitions. [2025-03-17 20:03:20,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-17 20:03:20,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-03-17 20:03:20,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 130 transitions. [2025-03-17 20:03:20,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 130 transitions. [2025-03-17 20:03:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 130 transitions. [2025-03-17 20:03:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2025-03-17 20:03:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 86 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2025-03-17 20:03:20,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 116 transitions. [2025-03-17 20:03:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:20,169 INFO L432 stractBuchiCegarLoop]: Abstraction has 87 states and 116 transitions. [2025-03-17 20:03:20,169 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:03:20,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 116 transitions. [2025-03-17 20:03:20,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-03-17 20:03:20,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:20,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:20,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:20,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,170 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,170 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume !(8640 == main_~s__state~0#1);" "assume 8656 == main_~s__state~0#1;" "assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3;" "assume !(4 == main_~blastFlag~0#1);" "assume !(5 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume 8640 == main_~s__state~0#1;" "assume !(3 == main_~blastFlag~0#1);" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 74369961, now seen corresponding path program 3 times [2025-03-17 20:03:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848600103] [2025-03-17 20:03:20,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:03:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:03:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash 741062776, now seen corresponding path program 1 times [2025-03-17 20:03:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923425667] [2025-03-17 20:03:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:03:20,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:03:20,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923425667] [2025-03-17 20:03:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923425667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:03:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115558781] [2025-03-17 20:03:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:20,194 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:03:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:20,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:20,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:20,194 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:20,206 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2025-03-17 20:03:20,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 127 transitions. [2025-03-17 20:03:20,207 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2025-03-17 20:03:20,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 127 transitions. [2025-03-17 20:03:20,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-03-17 20:03:20,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-03-17 20:03:20,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 127 transitions. [2025-03-17 20:03:20,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 127 transitions. [2025-03-17 20:03:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 127 transitions. [2025-03-17 20:03:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 20:03:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.309278350515464) internal successors, (127), 96 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2025-03-17 20:03:20,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 127 transitions. [2025-03-17 20:03:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:20,212 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 127 transitions. [2025-03-17 20:03:20,213 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:03:20,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 127 transitions. [2025-03-17 20:03:20,213 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2025-03-17 20:03:20,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:20,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:20,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:20,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,213 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,213 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume !(8640 == main_~s__state~0#1);" "assume 8656 == main_~s__state~0#1;" "assume !(2 == main_~blastFlag~0#1);" "assume !(4 == main_~blastFlag~0#1);" "assume !(5 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume 8640 == main_~s__state~0#1;" "assume !(3 == main_~blastFlag~0#1);" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 74369961, now seen corresponding path program 4 times [2025-03-17 20:03:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260944181] [2025-03-17 20:03:20,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:03:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:03:20,218 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,218 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:03:20,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 544549271, now seen corresponding path program 1 times [2025-03-17 20:03:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262001364] [2025-03-17 20:03:20,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:03:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:03:20,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262001364] [2025-03-17 20:03:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262001364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569662257] [2025-03-17 20:03:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:20,240 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:03:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:20,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:20,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:20,241 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:20,251 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2025-03-17 20:03:20,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 154 transitions. [2025-03-17 20:03:20,252 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:03:20,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 116 states and 146 transitions. [2025-03-17 20:03:20,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-03-17 20:03:20,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-03-17 20:03:20,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 146 transitions. [2025-03-17 20:03:20,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 146 transitions. [2025-03-17 20:03:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 146 transitions. [2025-03-17 20:03:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2025-03-17 20:03:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 90 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2025-03-17 20:03:20,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 118 transitions. [2025-03-17 20:03:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:20,258 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2025-03-17 20:03:20,258 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:03:20,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 118 transitions. [2025-03-17 20:03:20,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:03:20,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:20,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:20,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:20,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,258 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656;" [2025-03-17 20:03:20,258 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume !(8640 == main_~s__state~0#1);" "assume 8656 == main_~s__state~0#1;" "assume !(2 == main_~blastFlag~0#1);" "assume !(4 == main_~blastFlag~0#1);" "assume !(5 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640;" [2025-03-17 20:03:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 74369961, now seen corresponding path program 5 times [2025-03-17 20:03:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970110365] [2025-03-17 20:03:20,259 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:03:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,267 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:03:20,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash -925328032, now seen corresponding path program 1 times [2025-03-17 20:03:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535045350] [2025-03-17 20:03:20,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:20,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:20,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:20,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:20,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1829793464, now seen corresponding path program 1 times [2025-03-17 20:03:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037145003] [2025-03-17 20:03:20,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:03:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:03:20,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:20,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037145003] [2025-03-17 20:03:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037145003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:03:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107922469] [2025-03-17 20:03:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:20,338 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:20,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:20,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:20,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:20,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:20,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:20,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:20,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:20,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration9_Loop [2025-03-17 20:03:20,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:20,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:20,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:20,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:20,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:20,394 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:20,394 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:20,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:20,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:20,396 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:20,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:03:20,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:20,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:20,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:20,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:20,423 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:20,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:03:20,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:20,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:20,437 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:20,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:03:20,443 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:20,443 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:20,443 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:20,443 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:20,443 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:20,443 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:20,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:20,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:20,443 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration9_Loop [2025-03-17 20:03:20,443 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:20,443 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:20,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:20,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:20,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:20,496 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:20,496 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:20,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:20,499 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:20,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:03:20,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:20,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:20,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:20,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:20,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:20,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:20,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:20,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:20,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:20,514 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:20,514 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:03:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:20,516 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:20,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:03:20,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:20,518 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:20,518 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:20,518 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = 1*ULTIMATE.start_main_~s__state~0#1 Supporting invariants [] [2025-03-17 20:03:20,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 20:03:20,524 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:20,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:20,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:20,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:20,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:20,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:20,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:20,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:20,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:20,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:20,562 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:20,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 118 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 118 transitions. cyclomatic complexity: 36. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 126 states and 156 transitions. Complement of second has 6 states. [2025-03-17 20:03:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-03-17 20:03:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 5 letters. Loop has 9 letters. [2025-03-17 20:03:20,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 14 letters. Loop has 9 letters. [2025-03-17 20:03:20,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 5 letters. Loop has 18 letters. [2025-03-17 20:03:20,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:20,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 156 transitions. [2025-03-17 20:03:20,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:03:20,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 91 states and 114 transitions. [2025-03-17 20:03:20,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-17 20:03:20,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-17 20:03:20,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 114 transitions. [2025-03-17 20:03:20,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 114 transitions. [2025-03-17 20:03:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 114 transitions. [2025-03-17 20:03:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 20:03:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 90 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2025-03-17 20:03:20,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 114 transitions. [2025-03-17 20:03:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:20,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:20,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:20,584 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:20,597 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2025-03-17 20:03:20,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2025-03-17 20:03:20,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-17 20:03:20,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 51 states and 60 transitions. [2025-03-17 20:03:20,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 20:03:20,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-17 20:03:20,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2025-03-17 20:03:20,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:20,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-17 20:03:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2025-03-17 20:03:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 20:03:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-03-17 20:03:20,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-17 20:03:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:20,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-17 20:03:20,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:03:20,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2025-03-17 20:03:20,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-17 20:03:20,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:20,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:20,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:20,600 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(17, 2);call #Ultimate.allocInit(12, 3);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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume 8512 == main_~s__state~0#1;" [2025-03-17 20:03:20,600 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet5#1;main_~tmp___1~0#1 := main_#t~nondet5#1;" "assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume !(0 == main_~blastFlag~0#1);" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume 8512 == main_~s__state~0#1;" [2025-03-17 20:03:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -647541215, now seen corresponding path program 1 times [2025-03-17 20:03:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063195922] [2025-03-17 20:03:20,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:03:20,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:03:20,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:03:20,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:03:20,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2143440018, now seen corresponding path program 1 times [2025-03-17 20:03:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111101128] [2025-03-17 20:03:20,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:20,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:20,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:20,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:20,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 870376050, now seen corresponding path program 1 times [2025-03-17 20:03:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137526021] [2025-03-17 20:03:20,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:20,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:03:20,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:03:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:03:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:03:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:03:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 20:03:20,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:20,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:03:20,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:03:20,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:20,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:03:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:03:20,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:20,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:03:20 BoogieIcfgContainer [2025-03-17 20:03:20,811 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:03:20,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:03:20,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:03:20,811 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:03:20,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:17" (3/4) ... [2025-03-17 20:03:20,813 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 20:03:20,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 20:03:20,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:03:20,843 INFO L158 Benchmark]: Toolchain (without parser) took 3261.20ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 82.9MB in the end (delta: 23.6MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2025-03-17 20:03:20,843 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:20,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.58ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:03:20,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.50ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.9MB in the end (delta: 929.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:20,843 INFO L158 Benchmark]: Boogie Preprocessor took 13.52ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 94.0MB in the end (delta: 898.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:20,844 INFO L158 Benchmark]: IcfgBuilder took 189.97ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 81.9MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:03:20,844 INFO L158 Benchmark]: BuchiAutomizer took 2850.68ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 86.7MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:20,844 INFO L158 Benchmark]: Witness Printer took 31.14ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 82.9MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:20,848 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.75ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.58ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.50ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.9MB in the end (delta: 929.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.52ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 94.0MB in the end (delta: 898.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 189.97ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 81.9MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2850.68ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 86.7MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 31.14ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 82.9MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * blastFlag) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * s__state) + 8489) and consists of 4 locations. One deterministic module has affine ranking function s__state and consists of 5 locations. One deterministic module has affine ranking function (8576 + ((long long) -1 * s__state)) and consists of 5 locations. One deterministic module has affine ranking function s__state and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 51 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 471 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 303 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT1 conc0 concLT4 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf89 smp100 dnf145 smp81 tf114 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 80]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int blastFlag ; [L24] int tmp___1; [L26] s__state = 8466 [L27] blastFlag = 0 VAL [blastFlag=0, s__state=8466] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__state=8466] [L36] COND TRUE s__state == 8466 VAL [blastFlag=0] [L69] COND TRUE blastFlag == 0 [L70] blastFlag = 2 VAL [blastFlag=2] [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__state=8512] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__state=8512] [L36] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__state=8512] [L41] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0] Loop: [L80] tmp___1 = __VERIFIER_nondet_int() [L81] COND TRUE \read(tmp___1) [L82] s__state = 8466 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND TRUE s__state == 8466 [L69] COND FALSE !(blastFlag == 0) [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND FALSE !(s__state == 8466) [L41] COND TRUE s__state == 8512 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 80]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int blastFlag ; [L24] int tmp___1; [L26] s__state = 8466 [L27] blastFlag = 0 VAL [blastFlag=0, s__state=8466] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__state=8466] [L36] COND TRUE s__state == 8466 VAL [blastFlag=0] [L69] COND TRUE blastFlag == 0 [L70] blastFlag = 2 VAL [blastFlag=2] [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__state=8512] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__state=8512] [L36] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__state=8512] [L41] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0] Loop: [L80] tmp___1 = __VERIFIER_nondet_int() [L81] COND TRUE \read(tmp___1) [L82] s__state = 8466 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND TRUE s__state == 8466 [L69] COND FALSE !(blastFlag == 0) [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND FALSE !(s__state == 8466) [L41] COND TRUE s__state == 8512 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 20:03:20,863 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)