./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:13:13,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:13:13,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:13:13,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:13:13,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:13:13,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:13:13,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:13:13,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:13:13,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:13:13,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:13:13,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:13:13,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:13:13,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:13:13,674 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:13:13,676 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:13:13,676 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:13:13,676 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:13:13,676 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:13:13,676 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:13:13,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:13:13,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:13:13,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:13:13,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:13:13,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:13:13,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:13:13,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:13:13,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:13:13,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:13:13,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:13:13,680 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:13:13,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:13:13,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:13:13,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:13:13,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:13:13,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:13:13,681 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:13:13,682 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2024-11-19 14:13:13,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:13:13,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:13:13,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:13:13,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:13:13,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:13:13,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2024-11-19 14:13:15,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:13:15,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:13:15,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2024-11-19 14:13:15,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a6c697a/83c522d1f92041c3a5ce05053597a0b8/FLAGe9c528bcb [2024-11-19 14:13:15,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a6c697a/83c522d1f92041c3a5ce05053597a0b8 [2024-11-19 14:13:15,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:13:15,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:13:15,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:13:15,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:13:15,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:13:15,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9d4469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15, skipping insertion in model container [2024-11-19 14:13:15,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:13:15,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:13:15,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:13:15,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:13:15,618 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:13:15,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15 WrapperNode [2024-11-19 14:13:15,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:13:15,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:13:15,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:13:15,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:13:15,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,644 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-11-19 14:13:15,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:13:15,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:13:15,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:13:15,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:13:15,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,670 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]. [2024-11-19 14:13:15,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:13:15,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:13:15,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:13:15,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:13:15,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (1/1) ... [2024-11-19 14:13:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:15,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:15,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:13:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:13:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:13:15,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:13:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:13:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:13:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:13:15,906 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:13:15,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:13:16,013 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-19 14:13:16,013 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:13:16,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:13:16,029 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:13:16,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:13:16 BoogieIcfgContainer [2024-11-19 14:13:16,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:13:16,032 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:13:16,032 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:13:16,035 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:13:16,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:13:16,036 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:13:15" (1/3) ... [2024-11-19 14:13:16,037 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3490c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:13:16, skipping insertion in model container [2024-11-19 14:13:16,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:13:16,038 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:15" (2/3) ... [2024-11-19 14:13:16,038 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3490c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:13:16, skipping insertion in model container [2024-11-19 14:13:16,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:13:16,038 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:13:16" (3/3) ... [2024-11-19 14:13:16,039 INFO L332 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2024-11-19 14:13:16,092 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:13:16,093 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:13:16,093 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:13:16,093 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:13:16,093 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:13:16,093 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:13:16,094 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:13:16,094 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:13:16,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:16,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:13:16,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:16,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:16,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:13:16,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:13:16,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:13:16,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:16,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:13:16,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:16,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:16,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:13:16,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:13:16,122 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true 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; 7#L13-3true [2024-11-19 14:13:16,122 INFO L747 eck$LassoCheckResult]: Loop: 7#L13-3true 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; 5#L13-2true main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 7#L13-3true [2024-11-19 14:13:16,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:13:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168342882] [2024-11-19 14:13:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:16,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:16,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-19 14:13:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128985501] [2024-11-19 14:13:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:16,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:16,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:16,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:16,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-19 14:13:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353963289] [2024-11-19 14:13:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:16,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:16,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:16,508 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:13:16,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:13:16,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:13:16,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:13:16,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:13:16,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:13:16,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:13:16,510 INFO L132 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2024-11-19 14:13:16,510 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:13:16,510 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:13:16,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:16,733 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:13:16,736 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:13:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:16,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:16,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:13:16,744 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 [2024-11-19 14:13:16,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:16,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:16,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:16,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:16,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:16,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:16,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:16,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:16,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:16,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:16,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:13:16,779 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 [2024-11-19 14:13:16,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:16,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:16,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:16,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:16,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:16,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:16,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:16,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:16,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:13:16,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:16,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:16,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:13:16,811 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 [2024-11-19 14:13:16,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:16,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:16,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:16,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:16,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:16,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:16,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:16,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:16,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:16,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:16,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:16,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:13:16,839 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 [2024-11-19 14:13:16,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:16,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:16,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:16,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:16,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:13:16,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:13:16,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:16,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:13:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:16,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:16,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:13:16,904 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 [2024-11-19 14:13:16,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:16,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:16,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:16,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:16,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:16,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:16,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:16,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:16,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:13:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:16,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:16,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:13:16,953 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 [2024-11-19 14:13:16,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:16,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:16,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:16,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:16,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:13:16,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:13:16,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:13:16,996 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-19 14:13:16,996 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-19 14:13:16,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:17,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:17,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:13:17,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:13:17,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:13:17,030 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:13:17,031 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~n~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2024-11-19 14:13:17,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:17,058 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-19 14:13:17,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:13:17,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:13:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:17,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:13:17,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:13:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:17,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:13:17,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:13:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,229 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:13:17,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2024-11-19 14:13:17,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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) Result 22 states and 31 transitions. Complement of second has 6 states. [2024-11-19 14:13:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:13:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2024-11-19 14:13:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-19 14:13:17,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-19 14:13:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:13:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:13:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:13:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:13:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:13:17,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2024-11-19 14:13:17,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:17,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 9 states and 12 transitions. [2024-11-19 14:13:17,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:13:17,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:13:17,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2024-11-19 14:13:17,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:13:17,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-11-19 14:13:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2024-11-19 14:13:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-19 14:13:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2024-11-19 14:13:17,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-11-19 14:13:17,296 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-11-19 14:13:17,297 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:13:17,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2024-11-19 14:13:17,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:17,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:17,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:17,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:13:17,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:13:17,297 INFO L745 eck$LassoCheckResult]: Stem: 78#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 79#L-1 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; 76#L13-3 assume !(main_~n~0#1 < 10); 77#L13-4 havoc main_~n~0#1; 80#L17-5 [2024-11-19 14:13:17,298 INFO L747 eck$LassoCheckResult]: Loop: 80#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 82#L17-1 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; 81#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 80#L17-5 [2024-11-19 14:13:17,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-19 14:13:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225219519] [2024-11-19 14:13:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:13:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225219519] [2024-11-19 14:13:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225219519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:13:17,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:13:17,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:13:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287891874] [2024-11-19 14:13:17,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:13:17,337 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:13:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 1 times [2024-11-19 14:13:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607587934] [2024-11-19 14:13:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:17,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:17,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:13:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:13:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:13:17,442 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 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) [2024-11-19 14:13:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:13:17,455 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2024-11-19 14:13:17,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2024-11-19 14:13:17,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:17,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2024-11-19 14:13:17,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:13:17,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:13:17,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-11-19 14:13:17,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:13:17,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-19 14:13:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-11-19 14:13:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-19 14:13:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-19 14:13:17,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-19 14:13:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:13:17,460 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-19 14:13:17,462 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:13:17,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-19 14:13:17,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:17,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:17,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:17,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:13:17,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:13:17,463 INFO L745 eck$LassoCheckResult]: Stem: 101#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 102#L-1 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; 103#L13-3 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; 99#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 100#L13-3 assume !(main_~n~0#1 < 10); 104#L13-4 havoc main_~n~0#1; 107#L17-5 [2024-11-19 14:13:17,463 INFO L747 eck$LassoCheckResult]: Loop: 107#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 105#L17-1 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; 106#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 107#L17-5 [2024-11-19 14:13:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-19 14:13:17,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:17,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705495288] [2024-11-19 14:13:17,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:13:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705495288] [2024-11-19 14:13:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705495288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:13:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046294297] [2024-11-19 14:13:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:17,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:13:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:17,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:13:17,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 14:13:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:17,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:13:17,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:13:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:13:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046294297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:13:17,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:13:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 14:13:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619455433] [2024-11-19 14:13:17,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:13:17,608 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:13:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 2 times [2024-11-19 14:13:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625365350] [2024-11-19 14:13:17,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:13:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:17,620 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:13:17,620 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:13:17,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:17,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:13:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:13:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:13:17,757 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:13:17,785 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-11-19 14:13:17,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2024-11-19 14:13:17,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:17,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2024-11-19 14:13:17,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:13:17,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:13:17,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-11-19 14:13:17,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:13:17,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-19 14:13:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-11-19 14:13:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-19 14:13:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-19 14:13:17,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-19 14:13:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:13:17,791 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-19 14:13:17,791 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:13:17,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2024-11-19 14:13:17,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:17,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:17,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:17,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-19 14:13:17,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:13:17,792 INFO L745 eck$LassoCheckResult]: Stem: 165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 166#L-1 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; 167#L13-3 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; 168#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 169#L13-3 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; 163#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 164#L13-3 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; 177#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 176#L13-3 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; 175#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 174#L13-3 assume !(main_~n~0#1 < 10); 173#L13-4 havoc main_~n~0#1; 172#L17-5 [2024-11-19 14:13:17,792 INFO L747 eck$LassoCheckResult]: Loop: 172#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 170#L17-1 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; 171#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 172#L17-5 [2024-11-19 14:13:17,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:17,793 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-19 14:13:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:17,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652041645] [2024-11-19 14:13:17,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:13:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:17,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:13:17,812 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:13:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:13:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652041645] [2024-11-19 14:13:17,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652041645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:13:17,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599342532] [2024-11-19 14:13:17,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:13:17,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:13:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:17,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:13:17,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 14:13:17,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:13:17,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:13:17,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:13:17,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:13:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:17,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:13:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599342532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:13:18,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:13:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 14:13:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091620764] [2024-11-19 14:13:18,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:13:18,019 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:13:18,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 3 times [2024-11-19 14:13:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321231515] [2024-11-19 14:13:18,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:13:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:18,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:13:18,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:13:18,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:18,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:13:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 14:13:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 14:13:18,096 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:13:18,137 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-19 14:13:18,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2024-11-19 14:13:18,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:18,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2024-11-19 14:13:18,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:13:18,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:13:18,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2024-11-19 14:13:18,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:13:18,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-19 14:13:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2024-11-19 14:13:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 14:13:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-19 14:13:18,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-19 14:13:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:13:18,141 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-19 14:13:18,141 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:13:18,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2024-11-19 14:13:18,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:13:18,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:18,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:18,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-11-19 14:13:18,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:13:18,144 INFO L745 eck$LassoCheckResult]: Stem: 289#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 290#L-1 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; 291#L13-3 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; 292#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 293#L13-3 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; 287#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 288#L13-3 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; 313#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 312#L13-3 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; 311#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 310#L13-3 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; 309#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 308#L13-3 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; 307#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 306#L13-3 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; 305#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 304#L13-3 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; 303#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 302#L13-3 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; 301#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 300#L13-3 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; 299#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 298#L13-3 assume !(main_~n~0#1 < 10); 294#L13-4 havoc main_~n~0#1; 295#L17-5 [2024-11-19 14:13:18,144 INFO L747 eck$LassoCheckResult]: Loop: 295#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 296#L17-1 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; 297#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 295#L17-5 [2024-11-19 14:13:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-11-19 14:13:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267157636] [2024-11-19 14:13:18,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:13:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:18,166 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:13:18,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:13:18,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:18,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:18,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 4 times [2024-11-19 14:13:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:18,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558532907] [2024-11-19 14:13:18,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:13:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:18,191 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:13:18,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:13:18,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:18,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1328177118, now seen corresponding path program 1 times [2024-11-19 14:13:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919119800] [2024-11-19 14:13:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:18,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:18,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:13:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:18,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:20,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:20,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 14:13:20,786 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 14:13:20,791 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 14:13:20,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 14:13:20,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:13:20 BoogieIcfgContainer [2024-11-19 14:13:20,793 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:13:20,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:13:20,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:13:20,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:13:20,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:13:16" (3/4) ... [2024-11-19 14:13:20,795 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:13:20,799 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 14:13:20,799 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 14:13:20,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:13:20,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:13:20,825 INFO L158 Benchmark]: Toolchain (without parser) took 5419.85ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 76.6MB in the end (delta: 56.6MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,826 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:13:20,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.92ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 121.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.41ms. Allocated memory is still 184.5MB. Free memory was 121.4MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,826 INFO L158 Benchmark]: Boogie Preprocessor took 40.08ms. Allocated memory is still 184.5MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,827 INFO L158 Benchmark]: RCFGBuilder took 344.50ms. Allocated memory is still 184.5MB. Free memory was 117.7MB in the beginning and 107.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,827 INFO L158 Benchmark]: BuchiAutomizer took 4760.86ms. Allocated memory is still 184.5MB. Free memory was 106.7MB in the beginning and 79.6MB in the end (delta: 27.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,827 INFO L158 Benchmark]: Witness Printer took 31.75ms. Allocated memory is still 184.5MB. Free memory was 79.6MB in the beginning and 76.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:20,828 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.15ms. Allocated memory is still 184.5MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.92ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 121.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.41ms. Allocated memory is still 184.5MB. Free memory was 121.4MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.08ms. Allocated memory is still 184.5MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.50ms. Allocated memory is still 184.5MB. Free memory was 117.7MB in the beginning and 107.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4760.86ms. Allocated memory is still 184.5MB. Free memory was 106.7MB in the beginning and 79.6MB in the end (delta: 27.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 31.75ms. Allocated memory is still 184.5MB. Free memory was 79.6MB in the beginning and 76.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp100 ukn59 mio100 lsp62 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}] 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] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}] 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] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:13:20,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 14:13:21,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 14:13:21,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)