./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:50:33,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:50:33,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:50:33,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:50:33,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:50:33,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:50:33,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:50:33,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:50:33,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:50:33,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:50:33,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:50:33,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:50:33,453 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:50:33,453 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:50:33,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:50:33,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:50:33,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:50:33,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:50:33,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:50:33,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:50:33,455 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:50:33,455 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2025-03-17 19:50:33,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:50:33,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:50:33,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:50:33,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:50:33,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:50:33,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2025-03-17 19:50:34,815 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46b3ed5a/c44788f514e04ff9a3ee149bc9edb47c/FLAG2083664ad [2025-03-17 19:50:35,046 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:50:35,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2025-03-17 19:50:35,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46b3ed5a/c44788f514e04ff9a3ee149bc9edb47c/FLAG2083664ad [2025-03-17 19:50:35,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46b3ed5a/c44788f514e04ff9a3ee149bc9edb47c [2025-03-17 19:50:35,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:50:35,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:50:35,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:50:35,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:50:35,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:50:35,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540a7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35, skipping insertion in model container [2025-03-17 19:50:35,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:50:35,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:50:35,188 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:50:35,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:50:35,214 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:50:35,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35 WrapperNode [2025-03-17 19:50:35,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:50:35,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:50:35,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:50:35,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:50:35,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,235 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-03-17 19:50:35,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:50:35,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:50:35,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:50:35,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:50:35,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,254 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-17 19:50:35,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:50:35,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:50:35,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:50:35,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:50:35,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (1/1) ... [2025-03-17 19:50:35,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:35,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:35,299 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 19:50:35,304 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 19:50:35,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:50:35,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:50:35,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:50:35,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:50:35,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:50:35,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:50:35,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:50:35,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:50:35,460 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 19:50:35,463 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-17 19:50:35,463 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:50:35,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:50:35,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:50:35,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:50:35 BoogieIcfgContainer [2025-03-17 19:50:35,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:50:35,470 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:50:35,470 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:50:35,474 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:50:35,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:50:35,474 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:50:35" (1/3) ... [2025-03-17 19:50:35,475 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@777dd748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:50:35, skipping insertion in model container [2025-03-17 19:50:35,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:50:35,475 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:50:35" (2/3) ... [2025-03-17 19:50:35,475 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@777dd748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:50:35, skipping insertion in model container [2025-03-17 19:50:35,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:50:35,475 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:50:35" (3/3) ... [2025-03-17 19:50:35,476 INFO L363 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2025-03-17 19:50:35,521 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:50:35,521 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:50:35,521 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:50:35,521 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:50:35,521 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:50:35,522 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:50:35,522 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:50:35,522 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:50:35,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 19:50:35,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 19:50:35,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:50:35,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:50:35,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:50:35,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:50:35,541 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:50:35,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 19:50:35,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 19:50:35,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:50:35,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:50:35,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:50:35,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:50:35,547 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0;" [2025-03-17 19:50:35,547 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" [2025-03-17 19:50:35,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-17 19:50:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863097967] [2025-03-17 19:50:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:35,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:50:35,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:50:35,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:35,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:35,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:35,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:50:35,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:50:35,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:35,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:35,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-03-17 19:50:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143269001] [2025-03-17 19:50:35,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:50:35,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:50:35,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:35,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:35,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:35,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:50:35,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:50:35,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:35,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:35,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:35,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2025-03-17 19:50:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:35,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526566758] [2025-03-17 19:50:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:35,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:50:35,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:50:35,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:35,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:35,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:35,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:50:35,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:50:35,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:35,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:35,908 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:50:35,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:50:35,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:50:35,909 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:50:35,909 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:50:35,909 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:35,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:50:35,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:50:35,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2025-03-17 19:50:35,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:50:35,910 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:50:35,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:35,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:35,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:36,147 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:50:36,149 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:50:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,152 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 19:50:36,154 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 19:50:36,155 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 19:50:36,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:50:36,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:50:36,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:50:36,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:50:36,181 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 19:50:36,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,183 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 19:50:36,184 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 19:50:36,187 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 19:50:36,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:50:36,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:50:36,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:50:36,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:50:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:50:36,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,209 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 19:50:36,211 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 19:50:36,212 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 19:50:36,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:50:36,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:50:36,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:50:36,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:50:36,232 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 19:50:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,235 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 19:50:36,236 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 19:50:36,238 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 19:50:36,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:50:36,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:50:36,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:50:36,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:50:36,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,266 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 19:50:36,266 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 19:50:36,268 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 19:50:36,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:50:36,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:50:36,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:50:36,291 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 19:50:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,293 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 19:50:36,294 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 19:50:36,295 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 19:50:36,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:50:36,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:50:36,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:50:36,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:50:36,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,347 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 19:50:36,348 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 19:50:36,350 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 19:50:36,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:36,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:36,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:36,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:36,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:50:36,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:50:36,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:50:36,389 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 19:50:36,392 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:50:36,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,399 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 19:50:36,411 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 19:50:36,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:50:36,428 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:50:36,428 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:50:36,429 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~n~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-17 19:50:36,436 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 19:50:36,445 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-03-17 19:50:36,455 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:50:36,456 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:50:36,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:36,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:50:36,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:50:36,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:36,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:50:36,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:50:36,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:50:36,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:50:36,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:36,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:50:36,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:50:36,491 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 19:50:36,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 19:50:36,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 19:50:36,534 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 11 states and 16 transitions. Complement of second has 3 states. [2025-03-17 19:50:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:50:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 19:50:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 19:50:36,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 19:50:36,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:50:36,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 19:50:36,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:50:36,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 19:50:36,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:50:36,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-03-17 19:50:36,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:36,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 10 transitions. [2025-03-17 19:50:36,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-17 19:50:36,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 19:50:36,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2025-03-17 19:50:36,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:50:36,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-03-17 19:50:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2025-03-17 19:50:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2025-03-17 19:50:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:50:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2025-03-17 19:50:36,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 9 transitions. [2025-03-17 19:50:36,574 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2025-03-17 19:50:36,574 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:50:36,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2025-03-17 19:50:36,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:36,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:50:36,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:50:36,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:50:36,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:50:36,576 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0;" "assume !(main_~n~0#1 < 10);havoc main_~n~0#1;" [2025-03-17 19:50:36,576 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10;" "assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0;" "assume main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" [2025-03-17 19:50:36,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 1 times [2025-03-17 19:50:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:36,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205084750] [2025-03-17 19:50:36,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:36,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:50:36,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:50:36,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:36,621 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 19:50:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:50:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205084750] [2025-03-17 19:50:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205084750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:50:36,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:50:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:50:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737175937] [2025-03-17 19:50:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:50:36,626 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:50:36,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 1 times [2025-03-17 19:50:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:36,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361658024] [2025-03-17 19:50:36,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:36,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:36,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:36,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:36,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:36,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:36,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:36,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:36,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:36,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:50:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:50:36,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:50:36,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:50:36,748 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 19:50:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:50:36,755 INFO L93 Difference]: Finished difference Result 6 states and 8 transitions. [2025-03-17 19:50:36,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 8 transitions. [2025-03-17 19:50:36,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:36,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 8 transitions. [2025-03-17 19:50:36,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-17 19:50:36,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-17 19:50:36,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8 transitions. [2025-03-17 19:50:36,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:50:36,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-17 19:50:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 8 transitions. [2025-03-17 19:50:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-03-17 19:50:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 19:50:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-03-17 19:50:36,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-17 19:50:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:50:36,759 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-17 19:50:36,759 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:50:36,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2025-03-17 19:50:36,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:36,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:50:36,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:50:36,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:50:36,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:50:36,760 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume !(main_~n~0#1 < 10);havoc main_~n~0#1;" [2025-03-17 19:50:36,760 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10;" "assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0;" "assume main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" [2025-03-17 19:50:36,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 43660, now seen corresponding path program 1 times [2025-03-17 19:50:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:36,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290133877] [2025-03-17 19:50:36,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:36,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:36,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:36,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:50:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290133877] [2025-03-17 19:50:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290133877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:50:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153768802] [2025-03-17 19:50:36,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:36,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:50:36,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:36,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:50:36,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:50:36,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:36,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:36,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:36,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:50:36,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:50:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:36,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:50:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153768802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:50:36,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:50:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 19:50:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248849589] [2025-03-17 19:50:36,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:50:36,882 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:50:36,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 2 times [2025-03-17 19:50:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199551555] [2025-03-17 19:50:36,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:50:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:36,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:36,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:36,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:50:36,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:36,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:36,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:36,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:36,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:36,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:50:36,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:50:36,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:50:36,974 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 19:50:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:50:36,985 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2025-03-17 19:50:36,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2025-03-17 19:50:36,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:36,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2025-03-17 19:50:36,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-17 19:50:36,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-17 19:50:36,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-03-17 19:50:36,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:50:36,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-17 19:50:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-03-17 19:50:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:50:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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 19:50:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-03-17 19:50:36,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-17 19:50:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:50:36,988 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-17 19:50:36,988 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:50:36,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2025-03-17 19:50:36,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:36,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:50:36,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:50:36,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1] [2025-03-17 19:50:36,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:50:36,989 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume !(main_~n~0#1 < 10);havoc main_~n~0#1;" [2025-03-17 19:50:36,989 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10;" "assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0;" "assume main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" [2025-03-17 19:50:36,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1300717759, now seen corresponding path program 2 times [2025-03-17 19:50:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268431808] [2025-03-17 19:50:36,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:50:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:36,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:50:37,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:50:37,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:50:37,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:50:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268431808] [2025-03-17 19:50:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268431808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:50:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61121060] [2025-03-17 19:50:37,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:50:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:50:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:37,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:50:37,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:50:37,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:50:37,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:50:37,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:50:37,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:37,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:50:37,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:50:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:37,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:50:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61121060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:50:37,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:50:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 19:50:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905792047] [2025-03-17 19:50:37,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:50:37,247 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:50:37,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 3 times [2025-03-17 19:50:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:37,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162213756] [2025-03-17 19:50:37,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:50:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:37,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:37,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:37,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:50:37,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:37,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:37,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:37,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:37,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:50:37,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:50:37,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:50:37,371 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 19:50:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:50:37,392 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-03-17 19:50:37,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2025-03-17 19:50:37,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:37,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2025-03-17 19:50:37,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-17 19:50:37,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-17 19:50:37,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-03-17 19:50:37,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:50:37,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-17 19:50:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-03-17 19:50:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-17 19:50:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:50:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-17 19:50:37,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-17 19:50:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:50:37,396 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-17 19:50:37,396 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:50:37,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-03-17 19:50:37,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:50:37,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:50:37,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:50:37,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1] [2025-03-17 19:50:37,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:50:37,397 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume main_~n~0#1 < 10;havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1;main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1;" "assume !(main_~n~0#1 < 10);havoc main_~n~0#1;" [2025-03-17 19:50:37,397 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10;" "assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0;" "assume main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" [2025-03-17 19:50:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash -434627169, now seen corresponding path program 3 times [2025-03-17 19:50:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:37,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238626791] [2025-03-17 19:50:37,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:50:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:37,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-17 19:50:37,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:50:37,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:50:37,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:37,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:50:37,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:50:37,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:37,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 4 times [2025-03-17 19:50:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088337771] [2025-03-17 19:50:37,427 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:50:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:37,429 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 19:50:37,431 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:37,431 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:50:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:37,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:37,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:37,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:37,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:37,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1348415626, now seen corresponding path program 1 times [2025-03-17 19:50:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:50:37,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993895125] [2025-03-17 19:50:37,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:50:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:50:37,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:50:37,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:50:37,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:37,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:37,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:50:37,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:50:37,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:37,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:37,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:50:40,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:50:40,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:50:40,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:40,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:50:40,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:50:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:50:40,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:50:40,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-17 19:50:40,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-17 19:50:40,346 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-17 19:50:40,346 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-17 19:50:40,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:50:40 BoogieIcfgContainer [2025-03-17 19:50:40,347 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:50:40,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:50:40,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:50:40,348 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:50:40,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:50:35" (3/4) ... [2025-03-17 19:50:40,349 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 19:50:40,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-17 19:50:40,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-17 19:50:40,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:50:40,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:50:40,375 INFO L158 Benchmark]: Toolchain (without parser) took 5310.24ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 75.1MB in the end (delta: 47.3MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2025-03-17 19:50:40,375 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:40,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.88ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 112.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:50:40,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.90ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:40,376 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.1MB in the end (delta: 871.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:40,376 INFO L158 Benchmark]: IcfgBuilder took 199.75ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 99.2MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:50:40,376 INFO L158 Benchmark]: BuchiAutomizer took 4877.64ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 78.3MB in the end (delta: 20.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2025-03-17 19:50:40,376 INFO L158 Benchmark]: Witness Printer took 27.19ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 75.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:40,377 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.25ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.88ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 112.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.90ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.1MB in the end (delta: 871.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 199.75ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 99.2MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4877.64ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 78.3MB in the end (delta: 20.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 27.19ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 75.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 2 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 19 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp100 ukn59 mio100 lsp62 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) Loop: [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) Loop: [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 19:50:40,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:50:40,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:50:40,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)