./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:00:02,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:00:02,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:00:02,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:00:02,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:00:02,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:00:02,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:00:02,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:00:02,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:00:02,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:00:02,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:00:02,221 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:00:02,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:00:02,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:00:02,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:00:02,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:00:02,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:00:02,222 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:00:02,222 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-jdk21/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 -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2025-01-10 07:00:02,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:00:02,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:00:02,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:00:02,463 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:00:02,463 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:00:02,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2025-01-10 07:00:03,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be8f1ad9e/6c199a05c3b64af3aba9a31782ec569e/FLAG84489c540 [2025-01-10 07:00:03,955 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:00:03,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2025-01-10 07:00:03,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be8f1ad9e/6c199a05c3b64af3aba9a31782ec569e/FLAG84489c540 [2025-01-10 07:00:04,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be8f1ad9e/6c199a05c3b64af3aba9a31782ec569e [2025-01-10 07:00:04,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:00:04,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:00:04,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:00:04,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:00:04,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:00:04,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bb72c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04, skipping insertion in model container [2025-01-10 07:00:04,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:00:04,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:00:04,436 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:00:04,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:00:04,468 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:00:04,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04 WrapperNode [2025-01-10 07:00:04,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:00:04,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:00:04,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:00:04,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:00:04,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,488 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-01-10 07:00:04,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:00:04,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:00:04,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:00:04,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:00:04,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,511 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-01-10 07:00:04,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:00:04,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:00:04,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:00:04,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:00:04,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (1/1) ... [2025-01-10 07:00:04,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:04,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:04,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:00:04,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:00:04,632 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:00:04,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:00:04,748 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-10 07:00:04,748 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:00:04,762 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:00:04,763 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:00:04,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:00:04 BoogieIcfgContainer [2025-01-10 07:00:04,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:00:04,764 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:00:04,764 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:00:04,769 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:00:04,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:00:04,770 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:00:04" (1/3) ... [2025-01-10 07:00:04,774 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f806c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:00:04, skipping insertion in model container [2025-01-10 07:00:04,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:00:04,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:04" (2/3) ... [2025-01-10 07:00:04,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f806c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:00:04, skipping insertion in model container [2025-01-10 07:00:04,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:00:04,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:00:04" (3/3) ... [2025-01-10 07:00:04,776 INFO L363 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2025-01-10 07:00:04,858 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:00:04,858 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:00:04,858 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:00:04,858 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:00:04,858 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:00:04,858 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:00:04,858 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:00:04,863 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:00:04,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-01-10 07:00:04,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-01-10 07:00:04,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:04,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:04,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:00:04,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:00:04,880 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:00:04,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-01-10 07:00:04,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-01-10 07:00:04,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:04,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:04,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:00:04,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:00:04,886 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-01-10 07:00:04,887 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-01-10 07:00:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:00:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4540445] [2025-01-10 07:00:04,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:04,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:04,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:04,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:04,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:04,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:04,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:04,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:04,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:04,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:04,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 07:00:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776999006] [2025-01-10 07:00:04,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:04,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:00:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:00:04,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:04,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:04,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:04,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:00:04,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:00:04,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:04,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:04,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:04,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:00:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151043065] [2025-01-10 07:00:04,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:04,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:04,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:04,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:04,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:04,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:04,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:04,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:04,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:04,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:04,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:05,169 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:05,170 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:05,170 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:05,170 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:05,171 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:00:05,171 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,171 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:05,171 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:05,171 INFO L132 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2025-01-10 07:00:05,171 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:05,172 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:05,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:05,403 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:05,407 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:00:05,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,422 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-01-10 07:00:05,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:00:05,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:00:05,461 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-01-10 07:00:05,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:00:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:00:05,501 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-01-10 07:00:05,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:05,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:00:05,534 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-01-10 07:00:05,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:00:05,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:00:05,568 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-01-10 07:00:05,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:00:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:00:05,605 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-01-10 07:00:05,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:05,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:00:05,634 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-01-10 07:00:05,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:00:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:00:05,667 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-01-10 07:00:05,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:00:05,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:00:05,703 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-01-10 07:00:05,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:00:05,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:00:05,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:05,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:00:05,742 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-01-10 07:00:05,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:05,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:05,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:05,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:05,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:00:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,766 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:00:05,769 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-01-10 07:00:05,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:05,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:05,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:05,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:05,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:00:05,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:00:05,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:00:05,823 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-01-10 07:00:05,825 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-01-10 07:00:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:05,829 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:05,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:00:05,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:00:05,847 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:00:05,847 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:00:05,847 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-01-10 07:00:05,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:05,864 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-01-10 07:00:05,872 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:00:05,873 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:00:05,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:05,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:05,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:05,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:05,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:05,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:00:05,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:00:05,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:05,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:05,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:00:05,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:05,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:05,969 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-01-10 07:00:05,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,004 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 18 transitions. Complement of second has 3 states. [2025-01-10 07:00:06,006 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-01-10 07:00:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:00:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 07:00:06,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:00:06,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:00:06,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:06,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-01-10 07:00:06,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2025-01-10 07:00:06,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:00:06,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:00:06,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-01-10 07:00:06,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:06,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-01-10 07:00:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-01-10 07:00:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-01-10 07:00:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-01-10 07:00:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 07:00:06,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:00:06,030 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:00:06,030 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:00:06,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-01-10 07:00:06,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:06,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:06,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:00:06,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:00:06,031 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-01-10 07:00:06,031 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10;" "assume !main_#t~short4#1;" "assume main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;" "havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:00:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 07:00:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066011947] [2025-01-10 07:00:06,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:06,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:06,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:06,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:06,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066011947] [2025-01-10 07:00:06,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066011947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:00:06,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:00:06,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:00:06,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696252246] [2025-01-10 07:00:06,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,072 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:00:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1298026, now seen corresponding path program 1 times [2025-01-10 07:00:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271460885] [2025-01-10 07:00:06,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271460885] [2025-01-10 07:00:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271460885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:00:06,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:00:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:00:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553412419] [2025-01-10 07:00:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,086 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:00:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:00:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:00:06,088 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:06,094 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2025-01-10 07:00:06,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 10 transitions. [2025-01-10 07:00:06,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 07:00:06,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:00:06,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:00:06,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2025-01-10 07:00:06,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:06,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:00:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2025-01-10 07:00:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:00:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 07:00:06,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:00:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:00:06,096 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:00:06,096 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:00:06,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-01-10 07:00:06,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:06,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:06,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:00:06,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:00:06,097 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-01-10 07:00:06,097 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10;" "assume !main_#t~short4#1;" "assume main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;" "havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:00:06,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-10 07:00:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028988406] [2025-01-10 07:00:06,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:06,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028988406] [2025-01-10 07:00:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028988406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:00:06,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812860082] [2025-01-10 07:00:06,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:06,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:00:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:06,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:00:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 07:00:06,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:00:06,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:00:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812860082] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:00:06,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:00:06,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 07:00:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097345353] [2025-01-10 07:00:06,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,255 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:00:06,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1298026, now seen corresponding path program 2 times [2025-01-10 07:00:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182450931] [2025-01-10 07:00:06,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:00:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:06,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182450931] [2025-01-10 07:00:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182450931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:00:06,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:00:06,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:00:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569186357] [2025-01-10 07:00:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,286 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:00:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:06,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:00:06,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:00:06,286 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:06,293 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2025-01-10 07:00:06,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2025-01-10 07:00:06,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 9 transitions. [2025-01-10 07:00:06,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:00:06,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:00:06,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-01-10 07:00:06,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:06,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:00:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-01-10 07:00:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:00:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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-01-10 07:00:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-01-10 07:00:06,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:00:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:00:06,297 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:00:06,297 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:00:06,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-01-10 07:00:06,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:06,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:06,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:00:06,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:00:06,299 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-01-10 07:00:06,299 INFO L754 eck$LassoCheckResult]: Loop: "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;" "havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:00:06,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 2 times [2025-01-10 07:00:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934012272] [2025-01-10 07:00:06,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:00:06,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:00:06,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934012272] [2025-01-10 07:00:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934012272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:00:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389907984] [2025-01-10 07:00:06,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:06,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:00:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:06,368 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:00:06,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 07:00:06,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:00:06,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:00:06,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:00:06,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:00:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389907984] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:00:06,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:00:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 07:00:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669175164] [2025-01-10 07:00:06,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,420 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:00:06,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1296104, now seen corresponding path program 1 times [2025-01-10 07:00:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982157917] [2025-01-10 07:00:06,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:06,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:06,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:00:06,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:00:06,518 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-01-10 07:00:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:06,528 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-01-10 07:00:06,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2025-01-10 07:00:06,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2025-01-10 07:00:06,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:00:06,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:00:06,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-01-10 07:00:06,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:06,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:00:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-01-10 07:00:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:00:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-01-10 07:00:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-01-10 07:00:06,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:00:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:00:06,531 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:00:06,531 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:00:06,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-01-10 07:00:06,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:06,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:06,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-01-10 07:00:06,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:00:06,532 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-01-10 07:00:06,532 INFO L754 eck$LassoCheckResult]: Loop: "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;" "havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:00:06,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1805794469, now seen corresponding path program 3 times [2025-01-10 07:00:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125408356] [2025-01-10 07:00:06,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:00:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-01-10 07:00:06,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:00:06,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:00:06,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125408356] [2025-01-10 07:00:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125408356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:00:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496059867] [2025-01-10 07:00:06,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:00:06,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:00:06,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:06,613 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:00:06,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 07:00:06,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-01-10 07:00:06,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:00:06,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:00:06,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:06,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:00:06,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:00:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496059867] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:00:06,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:00:06,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 07:00:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923190067] [2025-01-10 07:00:06,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,724 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:00:06,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1296104, now seen corresponding path program 2 times [2025-01-10 07:00:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539948949] [2025-01-10 07:00:06,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:00:06,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:06,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:06,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:00:06,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:00:06,862 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:06,894 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-01-10 07:00:06,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2025-01-10 07:00:06,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2025-01-10 07:00:06,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:00:06,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:00:06,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2025-01-10 07:00:06,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:06,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-10 07:00:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2025-01-10 07:00:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-10 07:00:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-01-10 07:00:06,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-10 07:00:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:00:06,898 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-10 07:00:06,898 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:00:06,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2025-01-10 07:00:06,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:00:06,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:06,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:06,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-01-10 07:00:06,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:00:06,899 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-01-10 07:00:06,899 INFO L754 eck$LassoCheckResult]: Loop: "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;" "havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:00:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1496410277, now seen corresponding path program 4 times [2025-01-10 07:00:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485248426] [2025-01-10 07:00:06,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:00:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,909 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:00:06,925 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:00:06,925 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:00:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:06,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:00:06,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:00:06,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:06,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1296104, now seen corresponding path program 3 times [2025-01-10 07:00:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870090513] [2025-01-10 07:00:06,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:00:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:00:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:06,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:06,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:06,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 458767756, now seen corresponding path program 1 times [2025-01-10 07:00:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352302598] [2025-01-10 07:00:06,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:00:07,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:00:07,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:07,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:07,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:07,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:00:07,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:00:07,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:07,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:09,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:00:09,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:00:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:09,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:00:09,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:00:09,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:09,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:09,456 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-10 07:00:09,457 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-10 07:00:09,463 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-10 07:00:09,464 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-10 07:00:09,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:00:09 BoogieIcfgContainer [2025-01-10 07:00:09,467 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:00:09,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:00:09,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:00:09,468 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:00:09,469 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:00:04" (3/4) ... [2025-01-10 07:00:09,470 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:00:09,473 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-10 07:00:09,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-01-10 07:00:09,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:00:09,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:00:09,505 INFO L158 Benchmark]: Toolchain (without parser) took 5218.42ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 61.7MB in the end (delta: 60.9MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2025-01-10 07:00:09,506 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:09,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.90ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 112.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:00:09,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.17ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.4MB in the end (delta: 911.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:09,507 INFO L158 Benchmark]: Boogie Preprocessor took 33.54ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.5MB in the end (delta: 963.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:09,507 INFO L158 Benchmark]: RCFGBuilder took 237.09ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 99.5MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:00:09,507 INFO L158 Benchmark]: BuchiAutomizer took 4702.91ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 64.8MB in the end (delta: 34.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2025-01-10 07:00:09,508 INFO L158 Benchmark]: Witness Printer took 36.74ms. Allocated memory is still 167.8MB. Free memory was 64.8MB in the beginning and 61.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:00:09,509 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.48ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.90ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 112.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.17ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.4MB in the end (delta: 911.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.54ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.5MB in the end (delta: 963.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.09ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 99.5MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4702.91ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 64.8MB in the end (delta: 34.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 36.74ms. Allocated memory is still 167.8MB. Free memory was 64.8MB in the beginning and 61.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 2 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 6 iterations. TraceHistogramMax:10. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 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, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 33 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI2 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: 31ms 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] 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] i = __VERIFIER_nondet_int() [L20] a[i] = 0 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] 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] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:00:09,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 07:00:09,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:09,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:10,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)