./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/n.c11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/n.c11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22d07de108fc4801b9b7475bdc68ff9a5f4a90db882102d1715237a6b65777f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:16:53,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:16:54,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:16:54,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:16:54,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:16:54,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:16:54,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:16:54,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:16:54,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:16:54,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:16:54,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:16:54,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:16:54,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:16:54,041 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:16:54,042 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:16:54,042 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:16:54,042 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:16:54,042 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:16:54,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:16:54,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:16:54,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:16:54,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:16:54,044 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:16:54,044 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c22d07de108fc4801b9b7475bdc68ff9a5f4a90db882102d1715237a6b65777f [2025-03-09 07:16:54,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:16:54,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:16:54,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:16:54,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:16:54,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:16:54,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c11.c [2025-03-09 07:16:55,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a086ffa7/6ee6a5056ad54d428dfc773131888af7/FLAG916840fd0 [2025-03-09 07:16:55,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:16:55,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/n.c11.c [2025-03-09 07:16:55,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a086ffa7/6ee6a5056ad54d428dfc773131888af7/FLAG916840fd0 [2025-03-09 07:16:55,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a086ffa7/6ee6a5056ad54d428dfc773131888af7 [2025-03-09 07:16:55,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:16:55,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:16:55,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:16:55,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:16:55,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:16:55,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e42b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55, skipping insertion in model container [2025-03-09 07:16:55,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:16:55,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:16:55,723 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:16:55,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:16:55,746 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:16:55,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55 WrapperNode [2025-03-09 07:16:55,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:16:55,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:16:55,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:16:55,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:16:55,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,767 INFO L138 Inliner]: procedures = 13, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-03-09 07:16:55,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:16:55,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:16:55,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:16:55,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:16:55,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,787 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-09 07:16:55,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:16:55,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:16:55,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:16:55,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:16:55,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (1/1) ... [2025-03-09 07:16:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:16:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:55,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:16:55,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:16:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:16:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:16:55,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:16:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:16:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 07:16:55,905 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:16:55,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:16:56,004 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 07:16:56,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:16:56,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:16:56,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:16:56,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:16:56 BoogieIcfgContainer [2025-03-09 07:16:56,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:16:56,014 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:16:56,014 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:16:56,018 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:16:56,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:16:56,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:16:55" (1/3) ... [2025-03-09 07:16:56,020 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16bef23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:16:56, skipping insertion in model container [2025-03-09 07:16:56,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:16:56,020 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:16:55" (2/3) ... [2025-03-09 07:16:56,021 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16bef23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:16:56, skipping insertion in model container [2025-03-09 07:16:56,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:16:56,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:16:56" (3/3) ... [2025-03-09 07:16:56,022 INFO L363 chiAutomizerObserver]: Analyzing ICFG n.c11.c [2025-03-09 07:16:56,066 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:16:56,067 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:16:56,067 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:16:56,067 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:16:56,067 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:16:56,068 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:16:56,068 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:16:56,068 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:16:56,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:56,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:16:56,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:56,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:56,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:16:56,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 07:16:56,089 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:16:56,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:56,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:16:56,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:56,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:56,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:16:56,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 07:16:56,098 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1;" [2025-03-09 07:16:56,098 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0;" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:16:56,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-09 07:16:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406799521] [2025-03-09 07:16:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:56,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:56,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:16:56,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:16:56,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1352446, now seen corresponding path program 1 times [2025-03-09 07:16:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604583095] [2025-03-09 07:16:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:16:56,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:16:56,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:16:56,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:16:56,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1389404509, now seen corresponding path program 1 times [2025-03-09 07:16:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763049715] [2025-03-09 07:16:56,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:16:56,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:16:56,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763049715] [2025-03-09 07:16:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763049715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:16:56,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:16:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:16:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453436936] [2025-03-09 07:16:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:16:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:56,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:16:56,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:16:56,444 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:56,461 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-09 07:16:56,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-03-09 07:16:56,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 07:16:56,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 11 transitions. [2025-03-09 07:16:56,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 07:16:56,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 07:16:56,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-09 07:16:56,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:56,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-09 07:16:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-09 07:16:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-09 07:16:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-09 07:16:56,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-09 07:16:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:16:56,490 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-09 07:16:56,491 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:16:56,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-03-09 07:16:56,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:16:56,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:56,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:56,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:16:56,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 07:16:56,494 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" [2025-03-09 07:16:56,494 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0;" [2025-03-09 07:16:56,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 44819501, now seen corresponding path program 1 times [2025-03-09 07:16:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757274959] [2025-03-09 07:16:56,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:56,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:56,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:56,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:56,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1205476, now seen corresponding path program 2 times [2025-03-09 07:16:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846385940] [2025-03-09 07:16:56,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:16:56,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:16:56,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:16:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:16:56,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:16:56,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1150833424, now seen corresponding path program 1 times [2025-03-09 07:16:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528790588] [2025-03-09 07:16:56,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:16:56,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:16:56,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:16:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528790588] [2025-03-09 07:16:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528790588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:16:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854480191] [2025-03-09 07:16:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:16:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:16:56,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:16:56,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 07:16:56,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:16:56,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:16:56,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:16:56,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:16:56,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:16:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:56,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:16:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:16:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854480191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:16:56,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:16:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 07:16:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089797974] [2025-03-09 07:16:56,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:16:56,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:16:56,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:16:56,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:16:56,842 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:16:56,887 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-03-09 07:16:56,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2025-03-09 07:16:56,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-03-09 07:16:56,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2025-03-09 07:16:56,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-09 07:16:56,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-09 07:16:56,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2025-03-09 07:16:56,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:16:56,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-09 07:16:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2025-03-09 07:16:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-09 07:16:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:16:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-09 07:16:56,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-09 07:16:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:16:56,892 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-09 07:16:56,892 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:16:56,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2025-03-09 07:16:56,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-03-09 07:16:56,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:16:56,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:16:56,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:16:56,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 1] [2025-03-09 07:16:56,893 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" [2025-03-09 07:16:56,893 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0;" [2025-03-09 07:16:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 44819501, now seen corresponding path program 2 times [2025-03-09 07:16:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970471335] [2025-03-09 07:16:56,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:56,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:56,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:16:56,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:56,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:56,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash -611375216, now seen corresponding path program 1 times [2025-03-09 07:16:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465974341] [2025-03-09 07:16:56,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:16:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:16:56,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:16:56,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:16:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:16:56,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:56,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:16:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1327838140, now seen corresponding path program 2 times [2025-03-09 07:16:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:16:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009614778] [2025-03-09 07:16:56,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:16:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:16:56,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 07:16:56,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 07:16:56,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:16:56,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:56,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:56,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 07:16:57,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 07:16:57,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:57,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:16:57,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:57,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:57,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:57,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:16:57,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:16:57,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:16:57,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:16:57,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:16:57,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:16:57 BoogieIcfgContainer [2025-03-09 07:16:57,469 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:16:57,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:16:57,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:16:57,470 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:16:57,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:16:56" (3/4) ... [2025-03-09 07:16:57,472 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:16:57,501 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:16:57,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:16:57,504 INFO L158 Benchmark]: Toolchain (without parser) took 1909.56ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 94.2MB in the end (delta: 39.4MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-03-09 07:16:57,504 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 127.7MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:16:57,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.97ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 122.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:16:57,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.88ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:16:57,505 INFO L158 Benchmark]: Boogie Preprocessor took 23.66ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.6MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:16:57,505 INFO L158 Benchmark]: IcfgBuilder took 216.16ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 109.5MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:16:57,506 INFO L158 Benchmark]: BuchiAutomizer took 1455.49ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 98.0MB in the end (delta: 11.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2025-03-09 07:16:57,506 INFO L158 Benchmark]: Witness Printer took 33.44ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 94.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:16:57,507 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 201.3MB. Free memory was 128.0MB in the beginning and 127.7MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.97ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 122.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.88ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.66ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.6MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 216.16ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 109.5MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1455.49ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 98.0MB in the end (delta: 11.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 33.44ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 94.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:4. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 18 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int a[5]; [L16] unsigned int len=0; [L18] int i; VAL [len=0] [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) VAL [len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] unsigned int len=0; [L18] int i; VAL [len=0] [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) VAL [len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 07:16:57,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 07:16:57,722 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)