./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d 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/loop-invgen/id_build.i -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 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:34:07,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:34:07,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:34:07,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:34:07,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:34:07,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:34:07,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:34:07,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:34:07,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:34:07,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:34:07,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:34:07,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:34:07,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:34:07,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:34:07,794 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:34:07,795 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:34:07,795 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:34:07,795 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:34:07,796 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:34:07,796 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:34:07,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:34:07,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:34:07,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:34:07,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:34:07,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:34:07,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:34:07,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:34:07,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:34:07,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:34:07,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:34:07,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:34:07,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:34:07,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:34:07,801 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:34:07,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:34:07,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:34:07,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:34:07,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:34:07,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:34:07,816 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:34:07,816 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2024-11-17 08:34:08,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:34:08,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:34:08,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:34:08,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:34:08,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:34:08,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2024-11-17 08:34:09,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:34:09,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:34:09,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2024-11-17 08:34:09,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67a10e31/7ac5e267802f41db868ea4e767d3a2cf/FLAG476a96c7b [2024-11-17 08:34:09,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67a10e31/7ac5e267802f41db868ea4e767d3a2cf [2024-11-17 08:34:09,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:34:09,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:34:09,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:34:09,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:34:09,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:34:09,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:09,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4cb681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09, skipping insertion in model container [2024-11-17 08:34:09,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:09,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:34:09,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:34:09,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:34:09,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:34:09,990 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:34:09,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09 WrapperNode [2024-11-17 08:34:09,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:34:09,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:34:09,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:34:09,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:34:09,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,022 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 49 [2024-11-17 08:34:10,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:34:10,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:34:10,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:34:10,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:34:10,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,045 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:34:10,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:34:10,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:34:10,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:34:10,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:34:10,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (1/1) ... [2024-11-17 08:34:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:10,102 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-17 08:34:10,108 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-17 08:34:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:34:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:34:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:34:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:34:10,244 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:34:10,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:34:10,400 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-17 08:34:10,400 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:34:10,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:34:10,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:34:10,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:10 BoogieIcfgContainer [2024-11-17 08:34:10,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:34:10,414 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:34:10,414 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:34:10,418 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:34:10,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:10,419 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:34:09" (1/3) ... [2024-11-17 08:34:10,420 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4df91556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:34:10, skipping insertion in model container [2024-11-17 08:34:10,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:10,421 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:09" (2/3) ... [2024-11-17 08:34:10,421 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4df91556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:34:10, skipping insertion in model container [2024-11-17 08:34:10,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:10,421 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:10" (3/3) ... [2024-11-17 08:34:10,422 INFO L332 chiAutomizerObserver]: Analyzing ICFG id_build.i [2024-11-17 08:34:10,471 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:34:10,472 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:34:10,472 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:34:10,472 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:34:10,472 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:34:10,472 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:34:10,472 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:34:10,472 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:34:10,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-17 08:34:10,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-17 08:34:10,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:10,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:10,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:10,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:34:10,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:34:10,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-17 08:34:10,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-17 08:34:10,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:10,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:10,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:10,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:34:10,512 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue 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(9, 2); 14#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 7#L27true [2024-11-17 08:34:10,513 INFO L747 eck$LassoCheckResult]: Loop: 7#L27true assume true; 12#L27-2true assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 17#L28true assume !true; 19#L27-1true main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7#L27true [2024-11-17 08:34:10,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:10,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 1 times [2024-11-17 08:34:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:10,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019486513] [2024-11-17 08:34:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:10,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:10,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:10,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1845898, now seen corresponding path program 1 times [2024-11-17 08:34:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:10,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596610302] [2024-11-17 08:34:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:10,664 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-17 08:34:10,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596610302] [2024-11-17 08:34:10,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596610302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:10,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:34:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042034465] [2024-11-17 08:34:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:10,670 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:34:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:34:10,698 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-17 08:34:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:10,703 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-17 08:34:10,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2024-11-17 08:34:10,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:34:10,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 12 transitions. [2024-11-17 08:34:10,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-17 08:34:10,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-17 08:34:10,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2024-11-17 08:34:10,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:10,711 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-17 08:34:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2024-11-17 08:34:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-17 08:34:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-17 08:34:10,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-17 08:34:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:34:10,739 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-17 08:34:10,739 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:34:10,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2024-11-17 08:34:10,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:34:10,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:10,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:10,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:10,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:34:10,741 INFO L745 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY 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(9, 2); 53#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 54#L27 [2024-11-17 08:34:10,741 INFO L747 eck$LassoCheckResult]: Loop: 54#L27 assume true; 55#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 58#L28 assume true; 56#L28-1 assume !(main_~j~0#1 < 8); 57#L27-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 54#L27 [2024-11-17 08:34:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 2 times [2024-11-17 08:34:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060457858] [2024-11-17 08:34:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:10,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:10,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 57222438, now seen corresponding path program 1 times [2024-11-17 08:34:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953605615] [2024-11-17 08:34:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:10,829 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-17 08:34:10,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:10,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953605615] [2024-11-17 08:34:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953605615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:10,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:34:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382359037] [2024-11-17 08:34:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:10,830 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:10,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:34:10,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:34:10,834 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:10,851 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-17 08:34:10,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2024-11-17 08:34:10,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-17 08:34:10,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2024-11-17 08:34:10,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-17 08:34:10,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-17 08:34:10,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2024-11-17 08:34:10,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:10,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-17 08:34:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2024-11-17 08:34:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2024-11-17 08:34:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-17 08:34:10,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-17 08:34:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:34:10,859 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-17 08:34:10,861 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:34:10,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2024-11-17 08:34:10,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-17 08:34:10,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:10,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:10,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:10,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:10,862 INFO L745 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY 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(9, 2); 85#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 88#L27 [2024-11-17 08:34:10,862 INFO L747 eck$LassoCheckResult]: Loop: 88#L27 assume true; 89#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 92#L28 assume true; 90#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 86#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 87#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 82#L18 assume !(0 == __VERIFIER_assert_~cond#1); 83#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 91#L28 assume true; 94#L28-1 assume !(main_~j~0#1 < 8); 93#L27-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 88#L27 [2024-11-17 08:34:10,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 3 times [2024-11-17 08:34:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410325490] [2024-11-17 08:34:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:10,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:10,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1688442517, now seen corresponding path program 1 times [2024-11-17 08:34:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265829621] [2024-11-17 08:34:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:10,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265829621] [2024-11-17 08:34:10,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265829621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:10,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850110341] [2024-11-17 08:34:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:10,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:10,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:10,996 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) [2024-11-17 08:34:10,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 08:34:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:11,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:34:11,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:11,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850110341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:11,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-17 08:34:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978515609] [2024-11-17 08:34:11,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:11,128 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:11,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:11,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 08:34:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-17 08:34:11,130 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-17 08:34:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:11,175 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-17 08:34:11,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2024-11-17 08:34:11,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-17 08:34:11,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 32 transitions. [2024-11-17 08:34:11,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-17 08:34:11,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-17 08:34:11,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2024-11-17 08:34:11,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:11,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-17 08:34:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2024-11-17 08:34:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-17 08:34:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 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-17 08:34:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-17 08:34:11,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-17 08:34:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:34:11,184 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-17 08:34:11,184 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:34:11,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2024-11-17 08:34:11,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-17 08:34:11,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:11,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:11,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:11,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-17 08:34:11,187 INFO L745 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY 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(9, 2); 198#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 201#L27 [2024-11-17 08:34:11,188 INFO L747 eck$LassoCheckResult]: Loop: 201#L27 assume true; 202#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 206#L28 assume true; 225#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 224#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 207#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 196#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 204#L28 assume true; 203#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 199#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 200#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 223#L18 assume !(0 == __VERIFIER_assert_~cond#1); 222#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 221#L28 assume true; 220#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 219#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 218#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 217#L18 assume !(0 == __VERIFIER_assert_~cond#1); 216#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 215#L28 assume true; 214#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 209#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 213#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 212#L18 assume !(0 == __VERIFIER_assert_~cond#1); 211#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 210#L28 assume true; 208#L28-1 assume !(main_~j~0#1 < 8); 205#L27-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 201#L27 [2024-11-17 08:34:11,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 4 times [2024-11-17 08:34:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:11,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734681836] [2024-11-17 08:34:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:11,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1174556514, now seen corresponding path program 2 times [2024-11-17 08:34:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:11,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933734490] [2024-11-17 08:34:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933734490] [2024-11-17 08:34:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933734490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:11,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456557635] [2024-11-17 08:34:11,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:34:11,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:11,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:11,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:34:11,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 08:34:11,503 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:34:11,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:34:11,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:34:11,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:11,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456557635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:11,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-17 08:34:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476711489] [2024-11-17 08:34:11,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:11,735 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:11,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 08:34:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-17 08:34:11,736 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-17 08:34:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:11,789 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-17 08:34:11,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 56 transitions. [2024-11-17 08:34:11,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2024-11-17 08:34:11,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 56 transitions. [2024-11-17 08:34:11,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-17 08:34:11,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-17 08:34:11,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 56 transitions. [2024-11-17 08:34:11,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:11,794 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 56 transitions. [2024-11-17 08:34:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 56 transitions. [2024-11-17 08:34:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-17 08:34:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 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-17 08:34:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2024-11-17 08:34:11,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 56 transitions. [2024-11-17 08:34:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:34:11,802 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 56 transitions. [2024-11-17 08:34:11,802 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:34:11,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 56 transitions. [2024-11-17 08:34:11,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2024-11-17 08:34:11,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:11,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:11,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:11,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2024-11-17 08:34:11,804 INFO L745 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY 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(9, 2); 465#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 468#L27 [2024-11-17 08:34:11,805 INFO L747 eck$LassoCheckResult]: Loop: 468#L27 assume true; 469#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 473#L28 assume true; 516#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 515#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 474#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 462#L18 assume !(0 == __VERIFIER_assert_~cond#1); 463#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 471#L28 assume true; 470#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 466#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 467#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 514#L18 assume !(0 == __VERIFIER_assert_~cond#1); 513#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 512#L28 assume true; 511#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 510#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 509#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 508#L18 assume !(0 == __VERIFIER_assert_~cond#1); 507#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 506#L28 assume true; 505#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 504#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 503#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 502#L18 assume !(0 == __VERIFIER_assert_~cond#1); 501#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 500#L28 assume true; 499#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 498#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 497#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 496#L18 assume !(0 == __VERIFIER_assert_~cond#1); 495#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 494#L28 assume true; 493#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 492#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 491#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 490#L18 assume !(0 == __VERIFIER_assert_~cond#1); 489#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 488#L28 assume true; 487#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 486#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 485#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 484#L18 assume !(0 == __VERIFIER_assert_~cond#1); 483#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 482#L28 assume true; 481#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 476#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 480#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 479#L18 assume !(0 == __VERIFIER_assert_~cond#1); 478#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 477#L28 assume true; 475#L28-1 assume !(main_~j~0#1 < 8); 472#L27-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 468#L27 [2024-11-17 08:34:11,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2016, now seen corresponding path program 5 times [2024-11-17 08:34:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94835234] [2024-11-17 08:34:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1972340126, now seen corresponding path program 3 times [2024-11-17 08:34:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706990318] [2024-11-17 08:34:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash -201774305, now seen corresponding path program 1 times [2024-11-17 08:34:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:11,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903503710] [2024-11-17 08:34:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:11,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:12,604 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:12,605 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:12,605 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:12,605 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:12,605 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:12,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:12,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:12,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2024-11-17 08:34:12,606 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:12,606 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:12,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:12,700 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:12,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:12,704 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-17 08:34:12,706 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-17 08:34:12,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:12,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:12,729 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:12,729 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:12,745 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-17 08:34:12,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:12,748 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-17 08:34:12,750 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-17 08:34:12,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:12,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:12,769 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:12,769 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:12,787 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-17 08:34:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:12,793 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-17 08:34:12,798 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-17 08:34:12,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:12,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:12,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:12,834 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-17 08:34:12,836 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-17 08:34:12,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:12,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:12,900 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:12,905 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-17 08:34:12,906 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:12,906 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:12,906 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:12,906 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:12,906 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:12,906 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:12,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:12,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2024-11-17 08:34:12,907 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:12,907 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:12,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:12,965 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:12,969 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:12,973 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-17 08:34:12,974 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-17 08:34:12,976 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-17 08:34:12,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:12,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:12,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:12,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:12,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:12,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:12,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:12,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:13,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:13,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,016 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:34:13,021 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-17 08:34:13,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:13,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:13,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:13,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:13,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:13,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:13,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:13,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:13,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:34:13,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:34:13,057 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-17 08:34:13,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:13,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:13,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:13,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:13,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:13,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:13,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:13,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:13,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:34:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:34:13,094 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-17 08:34:13,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:13,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:13,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:13,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:13,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:13,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:13,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:13,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:13,117 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:34:13,117 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:34:13,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,121 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:34:13,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:13,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:13,126 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:13,127 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nlen~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-17 08:34:13,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:34:13,146 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:13,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:13,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:13,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:13,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:13,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-17 08:34:13,498 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-17 08:34:13,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 56 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 08:34:13,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 56 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) Result 108 states and 111 transitions. Complement of second has 6 states. [2024-11-17 08:34:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 08:34:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-17 08:34:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 53 letters. [2024-11-17 08:34:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 55 letters. Loop has 53 letters. [2024-11-17 08:34:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:13,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 106 letters. [2024-11-17 08:34:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:13,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 111 transitions. [2024-11-17 08:34:13,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:34:13,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 107 states and 110 transitions. [2024-11-17 08:34:13,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-17 08:34:13,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-17 08:34:13,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 110 transitions. [2024-11-17 08:34:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:13,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 110 transitions. [2024-11-17 08:34:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 110 transitions. [2024-11-17 08:34:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2024-11-17 08:34:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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-17 08:34:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-11-17 08:34:13,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-17 08:34:13,570 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-17 08:34:13,570 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:34:13,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 66 transitions. [2024-11-17 08:34:13,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:34:13,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:13,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:13,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:34:13,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:34:13,575 INFO L745 eck$LassoCheckResult]: Stem: 820#ULTIMATE.startENTRY 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(9, 2); 821#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 822#L27 assume true; 824#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 826#L28 [2024-11-17 08:34:13,575 INFO L747 eck$LassoCheckResult]: Loop: 826#L28 assume true; 829#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 816#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 817#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 812#L18 assume !(0 == __VERIFIER_assert_~cond#1); 813#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 826#L28 [2024-11-17 08:34:13,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1938335, now seen corresponding path program 1 times [2024-11-17 08:34:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090195053] [2024-11-17 08:34:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:13,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:13,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:13,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1596422194, now seen corresponding path program 1 times [2024-11-17 08:34:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447389408] [2024-11-17 08:34:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:13,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:13,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:13,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash -274506416, now seen corresponding path program 1 times [2024-11-17 08:34:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:13,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026218039] [2024-11-17 08:34:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:13,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:13,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:13,664 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:13,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:13,664 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:13,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:13,665 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:13,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:13,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:13,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2024-11-17 08:34:13,667 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:13,667 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:13,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,719 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:13,720 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,723 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:34:13,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:13,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:13,741 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:13,742 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:13,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:34:13,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,761 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:34:13,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:13,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:13,781 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:34:13,781 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2#1=0} Honda state: {ULTIMATE.start_main_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:34:13,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:34:13,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,798 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:34:13,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:13,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:13,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:13,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,830 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:34:13,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:13,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:13,868 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:13,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:13,874 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:13,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:13,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:13,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:13,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:13,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:13,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:13,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2024-11-17 08:34:13,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:13,875 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:13,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:13,927 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:13,927 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:13,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,929 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:34:13,941 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-17 08:34:13,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:13,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:13,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:13,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:13,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:13,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:13,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:13,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:13,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:34:13,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:34:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:13,974 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:13,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:34:13,976 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-17 08:34:13,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:13,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:13,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:13,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:13,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:13,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:13,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:13,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:14,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:34:14,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,007 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:34:14,009 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-17 08:34:14,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:14,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:14,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:14,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:14,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:14,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:14,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:14,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:14,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:34:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,036 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:34:14,038 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-17 08:34:14,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:14,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:14,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:14,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:14,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:14,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:14,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:14,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:14,056 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:14,056 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:14,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,058 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:34:14,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:14,060 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:14,061 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:14,061 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2024-11-17 08:34:14,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:34:14,077 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:14,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,136 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-17 08:34:14,137 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-17 08:34:14,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 66 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-17 08:34:14,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 66 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Result 168 states and 174 transitions. Complement of second has 7 states. [2024-11-17 08:34:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-17 08:34:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-17 08:34:14,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-17 08:34:14,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:14,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-17 08:34:14,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:14,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2024-11-17 08:34:14,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:14,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 174 transitions. [2024-11-17 08:34:14,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:34:14,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 115 states and 118 transitions. [2024-11-17 08:34:14,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-17 08:34:14,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-17 08:34:14,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 118 transitions. [2024-11-17 08:34:14,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:14,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 118 transitions. [2024-11-17 08:34:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 118 transitions. [2024-11-17 08:34:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-17 08:34:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.0263157894736843) internal successors, (117), 113 states have internal predecessors, (117), 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-17 08:34:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2024-11-17 08:34:14,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 117 transitions. [2024-11-17 08:34:14,185 INFO L425 stractBuchiCegarLoop]: Abstraction has 114 states and 117 transitions. [2024-11-17 08:34:14,185 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:34:14,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 117 transitions. [2024-11-17 08:34:14,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:34:14,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:14,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:14,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1] [2024-11-17 08:34:14,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:34:14,188 INFO L745 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY 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(9, 2); 1105#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 1106#L27 assume true; 1107#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 1116#L28 assume true; 1209#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1208#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1117#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1098#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1099#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1112#L28 assume true; 1114#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1102#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1103#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1207#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1206#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1205#L28 assume true; 1204#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1203#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1202#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1201#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1200#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1199#L28 assume true; 1198#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1197#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1196#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1195#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1194#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1193#L28 assume true; 1192#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1191#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1190#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1189#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1188#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1187#L28 assume true; 1186#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1185#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1184#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1183#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1182#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1181#L28 assume true; 1180#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1179#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1178#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1177#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1176#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1175#L28 assume true; 1129#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1130#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1125#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1126#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1121#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1122#L28 assume true; 1118#L28-1 assume !(main_~j~0#1 < 8); 1115#L27-1 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1108#L27 assume true; 1110#L27-2 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 1111#L28 [2024-11-17 08:34:14,188 INFO L747 eck$LassoCheckResult]: Loop: 1111#L28 assume true; 1113#L28-1 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1100#L18-1 assume !(0 == __VERIFIER_assert_~cond#1); 1101#L21-1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1096#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1097#L21 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1111#L28 [2024-11-17 08:34:14,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash -631577826, now seen corresponding path program 2 times [2024-11-17 08:34:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922829768] [2024-11-17 08:34:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1596422194, now seen corresponding path program 2 times [2024-11-17 08:34:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813178069] [2024-11-17 08:34:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1298083441, now seen corresponding path program 3 times [2024-11-17 08:34:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728035860] [2024-11-17 08:34:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:14,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:14,311 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:14,311 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:14,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:14,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:14,312 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:14,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:14,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:14,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration7_Loop [2024-11-17 08:34:14,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:14,312 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:14,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,361 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:14,361 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,363 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:34:14,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:14,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:14,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:14,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,397 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:34:14,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:14,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:14,439 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:14,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:34:14,444 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:14,444 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:14,444 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:14,444 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:14,444 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:14,444 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,444 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:14,444 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:14,444 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration7_Loop [2024-11-17 08:34:14,444 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:14,445 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:14,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:14,498 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:14,498 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,500 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:34:14,502 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-17 08:34:14,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:14,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:14,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:14,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:14,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:14,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:14,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:14,519 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:14,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:14,521 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:14,523 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:34:14,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:34:14,525 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:14,525 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:14,525 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:14,525 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2024-11-17 08:34:14,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:14,537 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:14,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,694 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-17 08:34:14,695 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-17 08:34:14,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 117 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 08:34:14,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 117 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 155 states and 159 transitions. Complement of second has 7 states. [2024-11-17 08:34:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 08:34:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-17 08:34:14,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 57 letters. Loop has 6 letters. [2024-11-17 08:34:14,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:14,716 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:14,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,850 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-17 08:34:14,850 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:34:14,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 117 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 08:34:14,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 117 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 155 states and 159 transitions. Complement of second has 7 states. [2024-11-17 08:34:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 08:34:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-17 08:34:14,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 57 letters. Loop has 6 letters. [2024-11-17 08:34:14,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:14,867 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:14,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:14,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:34:14,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:15,021 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-17 08:34:15,022 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:34:15,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 117 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 08:34:15,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 117 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 202 states and 208 transitions. Complement of second has 6 states. [2024-11-17 08:34:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 08:34:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2024-11-17 08:34:15,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 57 letters. Loop has 6 letters. [2024-11-17 08:34:15,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:15,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 63 letters. Loop has 6 letters. [2024-11-17 08:34:15,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:15,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 57 letters. Loop has 12 letters. [2024-11-17 08:34:15,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:15,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 208 transitions. [2024-11-17 08:34:15,046 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:34:15,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 0 states and 0 transitions. [2024-11-17 08:34:15,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:34:15,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:34:15,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:34:15,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:15,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:34:15,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:34:15,047 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:34:15,047 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:34:15,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:34:15,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:34:15,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:34:15,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:34:15 BoogieIcfgContainer [2024-11-17 08:34:15,054 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:34:15,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:34:15,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:34:15,055 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:34:15,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:10" (3/4) ... [2024-11-17 08:34:15,060 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:34:15,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:34:15,061 INFO L158 Benchmark]: Toolchain (without parser) took 5346.57ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 119.5MB in the beginning and 97.0MB in the end (delta: 22.5MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2024-11-17 08:34:15,061 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:34:15,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.54ms. Allocated memory is still 174.1MB. Free memory was 119.5MB in the beginning and 107.3MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 08:34:15,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.88ms. Allocated memory is still 174.1MB. Free memory was 107.0MB in the beginning and 105.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:34:15,062 INFO L158 Benchmark]: Boogie Preprocessor took 31.46ms. Allocated memory is still 174.1MB. Free memory was 105.8MB in the beginning and 104.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:34:15,062 INFO L158 Benchmark]: IcfgBuilder took 357.75ms. Allocated memory is still 174.1MB. Free memory was 104.1MB in the beginning and 139.0MB in the end (delta: -34.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-17 08:34:15,063 INFO L158 Benchmark]: BuchiAutomizer took 4640.83ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 139.0MB in the beginning and 97.0MB in the end (delta: 41.9MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-11-17 08:34:15,063 INFO L158 Benchmark]: Witness Printer took 5.83ms. Allocated memory is still 228.6MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:34:15,064 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.19ms. Allocated memory is still 117.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.54ms. Allocated memory is still 174.1MB. Free memory was 119.5MB in the beginning and 107.3MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.88ms. Allocated memory is still 174.1MB. Free memory was 107.0MB in the beginning and 105.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.46ms. Allocated memory is still 174.1MB. Free memory was 105.8MB in the beginning and 104.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 357.75ms. Allocated memory is still 174.1MB. Free memory was 104.1MB in the beginning and 139.0MB in the end (delta: -34.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 4640.83ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 139.0MB in the beginning and 97.0MB in the end (delta: 41.9MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 5.83ms. Allocated memory is still 228.6MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + nlen) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * j) + 15) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + 15) and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 8 iterations. TraceHistogramMax:9. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 49 StatesRemovedByMinimization, 3 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 184/184 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 98 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:34:15,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:15,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:15,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 08:34:15,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:15,892 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 Result: TRUE