./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Ex08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:34:08,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:34:08,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:34:08,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:34:08,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:34:08,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:34:08,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:34:08,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:34:08,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:34:08,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:34:08,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:34:08,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:34:08,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:34:08,648 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:34:08,649 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:34:08,649 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:34:08,649 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:34:08,650 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:34:08,650 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:34:08,654 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:34:08,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:34:08,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:34:08,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:34:08,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:34:08,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:34:08,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:34:08,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:34:08,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:34:08,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:34:08,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:34:08,657 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:34:08,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:34:08,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:34:08,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:34:08,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:34:08,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:34:08,658 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:34:08,659 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2024-11-10 22:34:08,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:34:08,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:34:08,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:34:08,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:34:08,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:34:08,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-11-10 22:34:10,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:34:10,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:34:10,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-11-10 22:34:10,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3286896/8f0e8f549bc3449297d28b8e254454c1/FLAG135b610b3 [2024-11-10 22:34:10,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3286896/8f0e8f549bc3449297d28b8e254454c1 [2024-11-10 22:34:10,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:34:10,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:34:10,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:34:10,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:34:10,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:34:10,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1f25bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10, skipping insertion in model container [2024-11-10 22:34:10,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:34:10,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:34:10,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:34:10,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:34:10,808 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:34:10,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10 WrapperNode [2024-11-10 22:34:10,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:34:10,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:34:10,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:34:10,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:34:10,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,833 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-10 22:34:10,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:34:10,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:34:10,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:34:10,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:34:10,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,849 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 22:34:10,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:34:10,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:34:10,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:34:10,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:34:10,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (1/1) ... [2024-11-10 22:34:10,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:10,887 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-10 22:34:10,889 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-10 22:34:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:34:10,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:34:11,017 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:34:11,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:34:11,099 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-10 22:34:11,099 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:34:11,118 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:34:11,118 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:34:11,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:11 BoogieIcfgContainer [2024-11-10 22:34:11,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:34:11,120 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:34:11,120 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:34:11,125 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:34:11,126 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:11,126 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:34:10" (1/3) ... [2024-11-10 22:34:11,127 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29e4673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:34:11, skipping insertion in model container [2024-11-10 22:34:11,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:11,127 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:10" (2/3) ... [2024-11-10 22:34:11,128 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29e4673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:34:11, skipping insertion in model container [2024-11-10 22:34:11,128 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:11,128 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:11" (3/3) ... [2024-11-10 22:34:11,131 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2024-11-10 22:34:11,193 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:34:11,194 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:34:11,194 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:34:11,194 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:34:11,195 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:34:11,195 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:34:11,195 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:34:11,195 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:34:11,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:11,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:34:11,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:11,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:11,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:11,225 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:11,226 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:34:11,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:11,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:34:11,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:11,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:11,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:11,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:11,236 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 6#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 10#L11true [2024-11-10 22:34:11,238 INFO L747 eck$LassoCheckResult]: Loop: 10#L11true assume true; 5#L11-1true assume !!(main_~i~0#1 > 0); 11#L12true assume 1 == main_~i~0#1;main_~up~0#1 := 1; 9#L15true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3#L18true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10#L11true [2024-11-10 22:34:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2024-11-10 22:34:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310450363] [2024-11-10 22:34:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:11,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:11,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 39092677, now seen corresponding path program 1 times [2024-11-10 22:34:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948897490] [2024-11-10 22:34:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:11,437 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-10 22:34:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:11,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948897490] [2024-11-10 22:34:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948897490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:11,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:11,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:34:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287928944] [2024-11-10 22:34:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:11,444 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:34:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:34:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:34:11,477 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-10 22:34:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:11,529 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-11-10 22:34:11,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-11-10 22:34:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-10 22:34:11,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 17 transitions. [2024-11-10 22:34:11,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:34:11,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:34:11,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-11-10 22:34:11,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:34:11,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-10 22:34:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-11-10 22:34:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-10 22:34:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-11-10 22:34:11,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-10 22:34:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:34:11,575 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-10 22:34:11,575 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:34:11,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-11-10 22:34:11,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-10 22:34:11,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:11,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:11,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:11,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:11,577 INFO L745 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 37#L11 [2024-11-10 22:34:11,577 INFO L747 eck$LassoCheckResult]: Loop: 37#L11 assume true; 38#L11-1 assume !!(main_~i~0#1 > 0); 39#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 42#L15 assume !(10 == main_~i~0#1); 43#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37#L11 [2024-11-10 22:34:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 2 times [2024-11-10 22:34:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484287801] [2024-11-10 22:34:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash 39092708, now seen corresponding path program 1 times [2024-11-10 22:34:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:11,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372129971] [2024-11-10 22:34:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:11,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1665602501, now seen corresponding path program 1 times [2024-11-10 22:34:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803530460] [2024-11-10 22:34:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:11,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:11,728 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:11,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:11,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:11,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:11,729 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:11,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:11,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:11,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:11,731 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration2_Loop [2024-11-10 22:34:11,731 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:11,731 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:11,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:11,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:11,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:11,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:11,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:11,865 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:11,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:11,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:11,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:34:11,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:11,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:11,967 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:11,967 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:11,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 22:34:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:12,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:34:12,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:12,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,030 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:12,030 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:12,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,045 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-10 22:34:12,046 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-10 22:34:12,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:12,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,073 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:12,073 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:12,089 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-10 22:34:12,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,091 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-10 22:34:12,093 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-10 22:34:12,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:12,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,123 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-10 22:34:12,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,127 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-10 22:34:12,128 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-10 22:34:12,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:12,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,147 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:12,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:34:12,163 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:12,164 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:12,164 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:12,164 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:12,164 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:12,164 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,164 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:12,164 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:12,164 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration2_Loop [2024-11-10 22:34:12,164 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:12,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:12,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,238 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:12,242 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,246 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-10 22:34:12,248 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-10 22:34:12,249 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-10 22:34:12,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:12,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:12,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:12,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:12,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:12,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:12,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:12,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:34:12,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,294 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-10 22:34:12,297 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-10 22:34:12,298 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-10 22:34:12,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:12,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:12,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:12,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:12,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:12,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:12,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:12,338 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-10 22:34:12,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,341 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-10 22:34:12,342 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-10 22:34:12,343 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-10 22:34:12,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:12,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:12,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:12,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:12,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:12,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:12,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:12,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:12,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:12,363 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:12,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,366 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-10 22:34:12,368 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-10 22:34:12,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:12,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:12,369 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:12,369 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 3 Supporting invariants [] [2024-11-10 22:34:12,380 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-10 22:34:12,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:12,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:12,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:12,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:12,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:12,470 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-10 22:34:12,473 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-10 22:34:12,475 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-10 22:34:12,533 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 29 states and 41 transitions. Complement of second has 7 states. [2024-11-10 22:34:12,535 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-10 22:34:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-10 22:34:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-10 22:34:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2024-11-10 22:34:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2024-11-10 22:34:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2024-11-10 22:34:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:12,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2024-11-10 22:34:12,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-10 22:34:12,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 41 transitions. [2024-11-10 22:34:12,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-10 22:34:12,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-10 22:34:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 41 transitions. [2024-11-10 22:34:12,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:12,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 41 transitions. [2024-11-10 22:34:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 41 transitions. [2024-11-10 22:34:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-10 22:34:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 27 states have internal predecessors, (40), 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-10 22:34:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2024-11-10 22:34:12,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 40 transitions. [2024-11-10 22:34:12,551 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2024-11-10 22:34:12,555 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:34:12,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2024-11-10 22:34:12,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-10 22:34:12,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:12,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:12,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 22:34:12,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:12,556 INFO L745 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 126#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 131#L11 assume true; 139#L11-1 [2024-11-10 22:34:12,556 INFO L747 eck$LassoCheckResult]: Loop: 139#L11-1 assume !!(main_~i~0#1 > 0); 143#L12 assume !(1 == main_~i~0#1); 144#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 146#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 145#L11 assume true; 139#L11-1 [2024-11-10 22:34:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 43659, now seen corresponding path program 1 times [2024-11-10 22:34:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542896157] [2024-11-10 22:34:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:12,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 38107598, now seen corresponding path program 1 times [2024-11-10 22:34:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081410426] [2024-11-10 22:34:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:12,603 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-10 22:34:12,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:12,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081410426] [2024-11-10 22:34:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081410426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:34:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840892480] [2024-11-10 22:34:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:12,608 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:34:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:12,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:34:12,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:34:12,608 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 15 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-10 22:34:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:12,620 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2024-11-10 22:34:12,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2024-11-10 22:34:12,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-10 22:34:12,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 54 transitions. [2024-11-10 22:34:12,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-10 22:34:12,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-10 22:34:12,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 54 transitions. [2024-11-10 22:34:12,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:12,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-10 22:34:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 54 transitions. [2024-11-10 22:34:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-10 22:34:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 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-10 22:34:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-10 22:34:12,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-10 22:34:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:34:12,631 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-10 22:34:12,631 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:34:12,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2024-11-10 22:34:12,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-10 22:34:12,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:12,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:12,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:12,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:12,633 INFO L745 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 205#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 206#L11 assume true; 218#L11-1 assume !!(main_~i~0#1 > 0); 228#L12 assume !(1 == main_~i~0#1); 224#L15 [2024-11-10 22:34:12,633 INFO L747 eck$LassoCheckResult]: Loop: 224#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 196#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 197#L11 assume true; 230#L11-1 assume !!(main_~i~0#1 > 0); 229#L12 assume !(1 == main_~i~0#1); 224#L15 [2024-11-10 22:34:12,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash 41956617, now seen corresponding path program 1 times [2024-11-10 22:34:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34965904] [2024-11-10 22:34:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:12,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash 33376809, now seen corresponding path program 1 times [2024-11-10 22:34:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462336783] [2024-11-10 22:34:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:12,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:12,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 234682913, now seen corresponding path program 1 times [2024-11-10 22:34:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083053020] [2024-11-10 22:34:12,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:12,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:12,700 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:12,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:12,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:12,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:12,701 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:12,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:12,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:12,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-11-10 22:34:12,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:12,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:12,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,763 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:12,763 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:12,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,793 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-10 22:34:12,794 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-10 22:34:12,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:12,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,818 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:12,820 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:12,836 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-10 22:34:12,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,839 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-10 22:34:12,840 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-10 22:34:12,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:12,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,870 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-10 22:34:12,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,876 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-10 22:34:12,877 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-10 22:34:12,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:12,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:12,898 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:12,913 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-10 22:34:12,913 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:12,913 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:12,913 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:12,913 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:12,913 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:12,914 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,914 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:12,914 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:12,914 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-11-10 22:34:12,914 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:12,914 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:12,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:12,975 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:12,975 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:12,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:12,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:12,978 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-10 22:34:12,979 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-10 22:34:12,980 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-10 22:34:12,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:12,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:12,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:12,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:12,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:12,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:13,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:13,016 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-10 22:34:13,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:13,018 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-10 22:34:13,019 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-10 22:34:13,020 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-10 22:34:13,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:13,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:13,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:13,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:13,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:13,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:13,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:13,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:13,038 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-10 22:34:13,038 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:13,041 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-10 22:34:13,042 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-10 22:34:13,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:13,043 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:13,043 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:13,043 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:34:13,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:34:13,058 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:13,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:13,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:13,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:13,156 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-10 22:34:13,157 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 22:34:13,157 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 51 transitions. cyclomatic complexity: 17 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-10 22:34:13,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 51 transitions. cyclomatic complexity: 17. 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 101 states and 145 transitions. Complement of second has 7 states. [2024-11-10 22:34:13,192 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-10 22:34:13,192 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-10 22:34:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-10 22:34:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 5 letters. [2024-11-10 22:34:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-10 22:34:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 10 letters. [2024-11-10 22:34:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:13,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 145 transitions. [2024-11-10 22:34:13,197 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 43 [2024-11-10 22:34:13,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 93 states and 130 transitions. [2024-11-10 22:34:13,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-10 22:34:13,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-11-10 22:34:13,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 130 transitions. [2024-11-10 22:34:13,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:13,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-10 22:34:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 130 transitions. [2024-11-10 22:34:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2024-11-10 22:34:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 69 states have internal predecessors, (100), 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-10 22:34:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2024-11-10 22:34:13,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 100 transitions. [2024-11-10 22:34:13,208 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 100 transitions. [2024-11-10 22:34:13,208 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:34:13,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 100 transitions. [2024-11-10 22:34:13,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2024-11-10 22:34:13,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:13,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:13,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:34:13,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:13,211 INFO L745 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 397#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 398#L11 assume true; 410#L11-1 assume !!(main_~i~0#1 > 0); 420#L12 assume !(1 == main_~i~0#1); 414#L15 assume !(10 == main_~i~0#1); 400#L18 [2024-11-10 22:34:13,211 INFO L747 eck$LassoCheckResult]: Loop: 400#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 451#L11 assume true; 450#L11-1 assume !!(main_~i~0#1 > 0); 441#L12 assume !(1 == main_~i~0#1); 399#L15 assume !(10 == main_~i~0#1); 400#L18 [2024-11-10 22:34:13,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1300655133, now seen corresponding path program 1 times [2024-11-10 22:34:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879271565] [2024-11-10 22:34:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:13,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,218 INFO L85 PathProgramCache]: Analyzing trace with hash 32660800, now seen corresponding path program 1 times [2024-11-10 22:34:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743055948] [2024-11-10 22:34:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1286135132, now seen corresponding path program 1 times [2024-11-10 22:34:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116032164] [2024-11-10 22:34:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:13,276 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:13,276 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:13,276 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:13,276 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:13,276 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:13,276 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,276 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:13,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:13,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-11-10 22:34:13,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:13,276 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:13,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,392 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:13,392 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:13,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:13,395 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-10 22:34:13,398 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-10 22:34:13,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:13,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:13,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:13,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:13,428 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-10 22:34:13,428 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-10 22:34:13,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:13,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:13,515 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:13,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:13,520 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:13,520 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:13,520 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:13,520 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:13,520 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:13,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:13,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:13,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-11-10 22:34:13,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:13,521 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:13,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:13,628 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:13,629 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:13,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:13,631 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-10 22:34:13,633 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-10 22:34:13,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:13,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:13,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:13,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:13,647 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-10 22:34:13,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:13,649 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-10 22:34:13,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:13,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:13,656 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-10 22:34:13,657 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:13,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:13,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:13,659 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-10 22:34:13,660 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-10 22:34:13,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:13,661 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:13,661 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:13,662 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:34:13,672 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-10 22:34:13,673 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:13,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:13,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:13,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:13,742 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-10 22:34:13,743 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 22:34:13,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 100 transitions. cyclomatic complexity: 37 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:13,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 100 transitions. cyclomatic complexity: 37. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 181 transitions. Complement of second has 7 states. [2024-11-10 22:34:13,771 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-10 22:34:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-10 22:34:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2024-11-10 22:34:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2024-11-10 22:34:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:13,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2024-11-10 22:34:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:13,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 181 transitions. [2024-11-10 22:34:13,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2024-11-10 22:34:13,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 114 states and 158 transitions. [2024-11-10 22:34:13,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-10 22:34:13,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-10 22:34:13,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 158 transitions. [2024-11-10 22:34:13,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:13,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 158 transitions. [2024-11-10 22:34:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 158 transitions. [2024-11-10 22:34:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-11-10 22:34:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.4) internal successors, (154), 109 states have internal predecessors, (154), 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-10 22:34:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2024-11-10 22:34:13,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-11-10 22:34:13,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-11-10 22:34:13,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:34:13,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 154 transitions. [2024-11-10 22:34:13,794 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2024-11-10 22:34:13,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:13,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:13,794 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-11-10 22:34:13,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:13,795 INFO L745 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 655#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 656#L11 assume true; 663#L11-1 assume !!(main_~i~0#1 > 0); 730#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 724#L15 assume !(10 == main_~i~0#1); 728#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 726#L11 assume true; 727#L11-1 assume !!(main_~i~0#1 > 0); 731#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 732#L15 assume !(10 == main_~i~0#1); 746#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 738#L11 [2024-11-10 22:34:13,795 INFO L747 eck$LassoCheckResult]: Loop: 738#L11 assume true; 745#L11-1 assume !!(main_~i~0#1 > 0); 742#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 739#L15 assume !(10 == main_~i~0#1); 737#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 738#L11 [2024-11-10 22:34:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1308043425, now seen corresponding path program 1 times [2024-11-10 22:34:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382985278] [2024-11-10 22:34:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382985278] [2024-11-10 22:34:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382985278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:34:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243428603] [2024-11-10 22:34:13,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:13,845 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:34:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash 39092709, now seen corresponding path program 1 times [2024-11-10 22:34:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100417043] [2024-11-10 22:34:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,860 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-10 22:34:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100417043] [2024-11-10 22:34:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100417043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:13,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:34:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077826288] [2024-11-10 22:34:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:13,862 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:34:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:13,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:34:13,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:34:13,864 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. cyclomatic complexity: 56 Second operand has 3 states, 2 states have (on average 2.5) 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-10 22:34:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:13,878 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-11-10 22:34:13,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 111 transitions. [2024-11-10 22:34:13,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2024-11-10 22:34:13,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 80 states and 102 transitions. [2024-11-10 22:34:13,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-10 22:34:13,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-10 22:34:13,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2024-11-10 22:34:13,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:13,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-10 22:34:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2024-11-10 22:34:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-10 22:34:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 73 states have internal predecessors, (96), 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-10 22:34:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2024-11-10 22:34:13,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 96 transitions. [2024-11-10 22:34:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:34:13,900 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 96 transitions. [2024-11-10 22:34:13,900 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:34:13,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 96 transitions. [2024-11-10 22:34:13,901 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-10 22:34:13,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:13,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:13,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 22:34:13,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:13,902 INFO L745 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 861#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 862#L11 assume true; 867#L11-1 assume !!(main_~i~0#1 > 0); 922#L12 assume !(1 == main_~i~0#1); 920#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 917#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 915#L11 assume true; 914#L11-1 assume !!(main_~i~0#1 > 0); 869#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 863#L15 [2024-11-10 22:34:13,902 INFO L747 eck$LassoCheckResult]: Loop: 863#L15 assume !(10 == main_~i~0#1); 864#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 872#L11 assume true; 882#L11-1 assume !!(main_~i~0#1 > 0); 883#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 863#L15 [2024-11-10 22:34:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash 234682912, now seen corresponding path program 1 times [2024-11-10 22:34:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968233479] [2024-11-10 22:34:13,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:13,916 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-10 22:34:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968233479] [2024-11-10 22:34:13,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968233479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:13,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:13,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:34:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373894128] [2024-11-10 22:34:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:13,945 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:34:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 34270538, now seen corresponding path program 2 times [2024-11-10 22:34:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492523390] [2024-11-10 22:34:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:13,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:13,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 22:34:13,976 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-10 22:34:14,004 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:14,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:14,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:14,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:14,005 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:14,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:14,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:14,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-11-10 22:34:14,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:14,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:14,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,058 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:14,058 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:14,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,060 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-10 22: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-10 22:34:14,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,079 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:14,079 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:14,089 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-10 22:34:14,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,091 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-10 22:34:14,092 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-10 22:34:14,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,113 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-10 22:34:14,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,115 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-10 22:34:14,115 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-10 22:34:14,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:14,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,131 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:14,145 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-10 22:34:14,145 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:14,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:14,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:14,146 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:14,146 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:14,146 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,146 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:14,146 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:14,146 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-11-10 22:34:14,146 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:14,146 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:14,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,208 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:14,209 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:14,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,211 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-10 22:34:14,215 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-10 22:34:14,216 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-10 22:34:14,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:14,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:14,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:14,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:14,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:14,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:14,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:14,257 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-10 22:34:14,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,259 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-10 22:34:14,260 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-10 22:34:14,261 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-10 22:34:14,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:14,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:14,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:14,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:14,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:14,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:14,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:14,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:14,280 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:14,280 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:14,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,281 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10 22:34:14,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 22:34:14,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:14,284 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:14,284 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:14,284 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-10 22:34:14,294 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-10 22:34:14,295 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:14,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:14,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:14,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:14,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:34:14,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:14,363 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-10 22:34:14,364 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 22:34:14,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 96 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:14,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 96 transitions. cyclomatic complexity: 31. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 152 states and 191 transitions. Complement of second has 9 states. [2024-11-10 22:34:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2024-11-10 22:34:14,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-10 22:34:14,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 5 letters. [2024-11-10 22:34:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 10 letters. Loop has 10 letters. [2024-11-10 22:34:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:14,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 191 transitions. [2024-11-10 22:34:14,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-10 22:34:14,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 135 states and 171 transitions. [2024-11-10 22:34:14,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-10 22:34:14,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-11-10 22:34:14,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 171 transitions. [2024-11-10 22:34:14,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:14,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 171 transitions. [2024-11-10 22:34:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 171 transitions. [2024-11-10 22:34:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2024-11-10 22:34:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 102 states have internal predecessors, (135), 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-10 22:34:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2024-11-10 22:34:14,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 135 transitions. [2024-11-10 22:34:14,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:14,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:34:14,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:34:14,435 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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-10 22:34:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:14,451 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2024-11-10 22:34:14,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2024-11-10 22:34:14,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2024-11-10 22:34:14,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 113 states and 141 transitions. [2024-11-10 22:34:14,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-10 22:34:14,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-10 22:34:14,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 141 transitions. [2024-11-10 22:34:14,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:14,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 141 transitions. [2024-11-10 22:34:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 141 transitions. [2024-11-10 22:34:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2024-11-10 22:34:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 81 states have internal predecessors, (104), 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-10 22:34:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2024-11-10 22:34:14,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 104 transitions. [2024-11-10 22:34:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:34:14,461 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 104 transitions. [2024-11-10 22:34:14,461 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:34:14,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 104 transitions. [2024-11-10 22:34:14,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2024-11-10 22:34:14,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:14,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:14,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 22:34:14,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:14,463 INFO L745 eck$LassoCheckResult]: Stem: 1385#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1386#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1387#L11 assume true; 1430#L11-1 assume !!(main_~i~0#1 > 0); 1416#L12 assume !(1 == main_~i~0#1); 1417#L15 assume !(10 == main_~i~0#1); 1377#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1378#L11 assume true; 1410#L11-1 assume !!(main_~i~0#1 > 0); 1402#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1400#L15 assume !(10 == main_~i~0#1); 1401#L18 [2024-11-10 22:34:14,463 INFO L747 eck$LassoCheckResult]: Loop: 1401#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1446#L11 assume true; 1445#L11-1 assume !!(main_~i~0#1 > 0); 1444#L12 assume !(1 == main_~i~0#1); 1442#L15 assume !(10 == main_~i~0#1); 1401#L18 [2024-11-10 22:34:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1286135163, now seen corresponding path program 1 times [2024-11-10 22:34:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417321456] [2024-11-10 22:34:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:14,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:14,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:14,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 31737279, now seen corresponding path program 1 times [2024-11-10 22:34:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699613505] [2024-11-10 22:34:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:14,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:14,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1292757573, now seen corresponding path program 1 times [2024-11-10 22:34:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297349660] [2024-11-10 22:34:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:14,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:14,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:14,521 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:14,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:14,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:14,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:14,521 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:14,522 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,522 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:14,522 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:14,522 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-11-10 22:34:14,522 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:14,522 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:14,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,622 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:14,622 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:14,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,624 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10 22:34:14,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 22:34:14,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:14,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,659 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10 22:34:14,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 22:34:14,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:14,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,733 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:14,734 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=12} Honda state: {ULTIMATE.start_main_~i~0#1=12} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [29, 15, 1] Nus: [1, 0] [2024-11-10 22:34:14,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:14,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,746 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10 22:34:14,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 22:34:14,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,758 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:14,758 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:14,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-10 22:34:14,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,770 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10 22:34:14,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-10 22:34:14,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,791 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:14,792 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:14,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,803 INFO L229 MonitoredProcess]: Starting monitored process 31 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-10 22:34:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 22:34:14,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:14,822 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:14,822 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:14,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:14,868 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:14,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:14,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:14,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:14,869 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:14,869 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,869 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:14,869 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:14,869 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Lasso [2024-11-10 22:34:14,869 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:14,869 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:14,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:14,992 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:14,993 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:14,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:14,996 INFO L229 MonitoredProcess]: Starting monitored process 32 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-10 22:34:14,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 22:34:14,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:14,998 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:15,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-10 22:34:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,028 INFO L229 MonitoredProcess]: Starting monitored process 33 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-10 22:34:15,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 22:34:15,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:15,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:15,149 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:15,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-10 22:34:15,155 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:15,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:15,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:15,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:15,155 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:15,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:15,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:15,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Lasso [2024-11-10 22:34:15,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:15,156 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:15,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:15,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:15,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:15,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:15,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:15,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:15,275 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:15,275 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,277 INFO L229 MonitoredProcess]: Starting monitored process 34 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-10 22:34:15,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 22:34:15,278 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-10 22:34:15,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:15,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:15,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:15,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:15,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:15,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:15,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:15,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-10 22:34:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,306 INFO L229 MonitoredProcess]: Starting monitored process 35 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-10 22:34:15,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-10 22:34:15,307 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-10 22:34:15,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:15,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:15,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:15,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:15,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:15,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:15,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:15,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-10 22:34:15,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,338 INFO L229 MonitoredProcess]: Starting monitored process 36 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-10 22:34:15,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 22:34:15,340 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-10 22:34:15,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:15,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:15,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:15,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:15,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:15,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:15,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:15,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:15,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-10 22:34:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,374 INFO L229 MonitoredProcess]: Starting monitored process 37 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-10 22:34:15,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 22:34:15,378 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-10 22:34:15,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:15,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:15,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:15,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:15,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:15,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:15,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:15,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:15,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,411 INFO L229 MonitoredProcess]: Starting monitored process 38 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-10 22:34:15,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 22:34:15,413 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-10 22:34:15,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:15,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:15,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:15,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:15,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:15,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:15,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:15,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:15,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:15,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,451 INFO L229 MonitoredProcess]: Starting monitored process 39 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-10 22:34:15,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 22:34:15,454 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-10 22:34:15,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:15,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:15,465 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-10 22:34:15,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:15,471 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-10 22:34:15,471 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-10 22:34:15,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:15,506 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-10 22:34:15,506 INFO L444 ModelExtractionUtils]: 2 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-10 22:34:15,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:15,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:15,509 INFO L229 MonitoredProcess]: Starting monitored process 40 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-10 22:34:15,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 22:34:15,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:15,528 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-10 22:34:15,528 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:15,528 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 9 >= 0] [2024-11-10 22:34:15,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:15,547 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-11-10 22:34:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:15,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:15,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:15,611 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:15,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:15,651 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-10 22:34:15,652 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:34:15,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:15,697 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 90 states and 113 transitions. Complement of second has 5 states. [2024-11-10 22:34:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2024-11-10 22:34:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-10 22:34:15,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 5 letters. [2024-11-10 22:34:15,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:15,699 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:15,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:15,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:15,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:15,759 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:15,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:15,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:15,806 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-10 22:34:15,807 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:34:15,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:15,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-10 22:34:15,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 175 states and 213 transitions. Complement of second has 12 states. [2024-11-10 22:34:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2024-11-10 22:34:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2024-11-10 22:34:15,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2024-11-10 22:34:15,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:15,887 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:15,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:15,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:15,935 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:15,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:15,968 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-10 22:34:15,968 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:34:15,968 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:16,008 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 91 states and 113 transitions. Complement of second has 4 states. [2024-11-10 22:34:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2024-11-10 22:34:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-10 22:34:16,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 5 letters. [2024-11-10 22:34:16,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:16,011 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:16,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,071 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:16,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:16,105 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-10 22:34:16,105 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:34:16,105 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:16,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 104 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 180 states and 220 transitions. Complement of second has 22 states. [2024-11-10 22:34:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2024-11-10 22:34:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10 22:34:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2024-11-10 22:34:16,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 11 letters. Loop has 5 letters. [2024-11-10 22:34:16,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:16,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 16 letters. Loop has 5 letters. [2024-11-10 22:34:16,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:16,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 11 letters. Loop has 10 letters. [2024-11-10 22:34:16,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:16,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 220 transitions. [2024-11-10 22:34:16,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-11-10 22:34:16,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 117 states and 144 transitions. [2024-11-10 22:34:16,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-10 22:34:16,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-10 22:34:16,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 144 transitions. [2024-11-10 22:34:16,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:16,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 144 transitions. [2024-11-10 22:34:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 144 transitions. [2024-11-10 22:34:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2024-11-10 22:34:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 97 states have internal predecessors, (123), 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-10 22:34:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-11-10 22:34:16,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-10 22:34:16,198 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-10 22:34:16,198 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:34:16,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 123 transitions. [2024-11-10 22:34:16,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-11-10 22:34:16,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:16,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:16,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 22:34:16,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 1, 1, 1] [2024-11-10 22:34:16,200 INFO L745 eck$LassoCheckResult]: Stem: 2288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2289#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 2294#L11 assume true; 2339#L11-1 assume !!(main_~i~0#1 > 0); 2337#L12 assume !(1 == main_~i~0#1); 2335#L15 assume !(10 == main_~i~0#1); 2284#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2285#L11 assume true; 2319#L11-1 assume !!(main_~i~0#1 > 0); 2316#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 2317#L15 assume !(10 == main_~i~0#1); 2305#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2299#L11 [2024-11-10 22:34:16,200 INFO L747 eck$LassoCheckResult]: Loop: 2299#L11 assume true; 2290#L11-1 assume !!(main_~i~0#1 > 0); 2291#L12 assume !(1 == main_~i~0#1); 2360#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2361#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2369#L11 assume true; 2367#L11-1 assume !!(main_~i~0#1 > 0); 2365#L12 assume !(1 == main_~i~0#1); 2364#L15 assume !(10 == main_~i~0#1); 2345#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2346#L11 assume true; 2321#L11-1 assume !!(main_~i~0#1 > 0); 2322#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 2312#L15 assume !(10 == main_~i~0#1); 2313#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2299#L11 [2024-11-10 22:34:16,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1215484386, now seen corresponding path program 2 times [2024-11-10 22:34:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562257646] [2024-11-10 22:34:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1283625317, now seen corresponding path program 1 times [2024-11-10 22:34:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125885060] [2024-11-10 22:34:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125885060] [2024-11-10 22:34:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125885060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013570084] [2024-11-10 22:34:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:16,265 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:16,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-10 22:34:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:16,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:16,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013570084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:16,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 22:34:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161042584] [2024-11-10 22:34:16,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:16,348 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:34:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 22:34:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-10 22:34:16,348 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. cyclomatic complexity: 34 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:16,399 INFO L93 Difference]: Finished difference Result 213 states and 253 transitions. [2024-11-10 22:34:16,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 253 transitions. [2024-11-10 22:34:16,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-11-10 22:34:16,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 213 states and 253 transitions. [2024-11-10 22:34:16,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-11-10 22:34:16,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-11-10 22:34:16,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 253 transitions. [2024-11-10 22:34:16,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:16,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 213 states and 253 transitions. [2024-11-10 22:34:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 253 transitions. [2024-11-10 22:34:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 159. [2024-11-10 22:34:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.1823899371069182) internal successors, (188), 158 states have internal predecessors, (188), 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-10 22:34:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2024-11-10 22:34:16,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 159 states and 188 transitions. [2024-11-10 22:34:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 22:34:16,418 INFO L425 stractBuchiCegarLoop]: Abstraction has 159 states and 188 transitions. [2024-11-10 22:34:16,418 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:34:16,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 188 transitions. [2024-11-10 22:34:16,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-11-10 22:34:16,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:16,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:16,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 22:34:16,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1] [2024-11-10 22:34:16,420 INFO L745 eck$LassoCheckResult]: Stem: 2698#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2699#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 2700#L11 assume true; 2743#L11-1 assume !!(main_~i~0#1 > 0); 2741#L12 assume !(1 == main_~i~0#1); 2717#L15 assume !(10 == main_~i~0#1); 2719#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2738#L11 assume true; 2737#L11-1 assume !!(main_~i~0#1 > 0); 2735#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 2730#L15 assume !(10 == main_~i~0#1); 2731#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2710#L11 [2024-11-10 22:34:16,420 INFO L747 eck$LassoCheckResult]: Loop: 2710#L11 assume true; 2831#L11-1 assume !!(main_~i~0#1 > 0); 2829#L12 assume !(1 == main_~i~0#1); 2817#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2714#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2705#L11 assume true; 2694#L11-1 assume !!(main_~i~0#1 > 0); 2695#L12 assume !(1 == main_~i~0#1); 2706#L15 assume !(10 == main_~i~0#1); 2821#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2820#L11 assume true; 2819#L11-1 assume !!(main_~i~0#1 > 0); 2818#L12 assume !(1 == main_~i~0#1); 2816#L15 assume !(10 == main_~i~0#1); 2806#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2807#L11 assume true; 2826#L11-1 assume !!(main_~i~0#1 > 0); 2801#L12 assume !(1 == main_~i~0#1); 2802#L15 assume !(10 == main_~i~0#1); 2797#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2798#L11 assume true; 2823#L11-1 assume !!(main_~i~0#1 > 0); 2792#L12 assume !(1 == main_~i~0#1); 2793#L15 assume !(10 == main_~i~0#1); 2789#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2788#L11 assume true; 2787#L11-1 assume !!(main_~i~0#1 > 0); 2786#L12 assume !(1 == main_~i~0#1); 2729#L15 assume !(10 == main_~i~0#1); 2815#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2753#L11 assume true; 2754#L11-1 assume !!(main_~i~0#1 > 0); 2728#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 2727#L15 assume !(10 == main_~i~0#1); 2726#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2710#L11 [2024-11-10 22:34:16,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1215484386, now seen corresponding path program 3 times [2024-11-10 22:34:16,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270676573] [2024-11-10 22:34:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:16,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash -406611803, now seen corresponding path program 2 times [2024-11-10 22:34:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346208364] [2024-11-10 22:34:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 35 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346208364] [2024-11-10 22:34:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346208364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068743289] [2024-11-10 22:34:16,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:34:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:16,556 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:16,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-10 22:34:16,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:34:16,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:16,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:34:16,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 35 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:16,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 35 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068743289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:16,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-11-10 22:34:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702061236] [2024-11-10 22:34:16,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:16,747 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:34:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 22:34:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-10 22:34:16,747 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. cyclomatic complexity: 38 Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-10 22:34:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:16,810 INFO L93 Difference]: Finished difference Result 288 states and 337 transitions. [2024-11-10 22:34:16,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 337 transitions. [2024-11-10 22:34:16,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2024-11-10 22:34:16,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 288 states and 337 transitions. [2024-11-10 22:34:16,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2024-11-10 22:34:16,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2024-11-10 22:34:16,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 337 transitions. [2024-11-10 22:34:16,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:16,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 337 transitions. [2024-11-10 22:34:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 337 transitions. [2024-11-10 22:34:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 204. [2024-11-10 22:34:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.1568627450980393) internal successors, (236), 203 states have internal predecessors, (236), 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-10 22:34:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2024-11-10 22:34:16,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 236 transitions. [2024-11-10 22:34:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 22:34:16,822 INFO L425 stractBuchiCegarLoop]: Abstraction has 204 states and 236 transitions. [2024-11-10 22:34:16,822 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 22:34:16,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 236 transitions. [2024-11-10 22:34:16,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2024-11-10 22:34:16,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:16,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:16,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 22:34:16,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 9, 9, 9, 1, 1, 1] [2024-11-10 22:34:16,824 INFO L745 eck$LassoCheckResult]: Stem: 3363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3364#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3365#L11 assume true; 3408#L11-1 assume !!(main_~i~0#1 > 0); 3406#L12 assume !(1 == main_~i~0#1); 3381#L15 assume !(10 == main_~i~0#1); 3383#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3402#L11 assume true; 3401#L11-1 assume !!(main_~i~0#1 > 0); 3399#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3394#L15 assume !(10 == main_~i~0#1); 3395#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3376#L11 [2024-11-10 22:34:16,824 INFO L747 eck$LassoCheckResult]: Loop: 3376#L11 assume true; 3538#L11-1 assume !!(main_~i~0#1 > 0); 3535#L12 assume !(1 == main_~i~0#1); 3520#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3377#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3378#L11 assume true; 3546#L11-1 assume !!(main_~i~0#1 > 0); 3545#L12 assume !(1 == main_~i~0#1); 3528#L15 assume !(10 == main_~i~0#1); 3527#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3526#L11 assume true; 3525#L11-1 assume !!(main_~i~0#1 > 0); 3524#L12 assume !(1 == main_~i~0#1); 3522#L15 assume !(10 == main_~i~0#1); 3523#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3508#L11 assume true; 3509#L11-1 assume !!(main_~i~0#1 > 0); 3504#L12 assume !(1 == main_~i~0#1); 3505#L15 assume !(10 == main_~i~0#1); 3501#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3500#L11 assume true; 3499#L11-1 assume !!(main_~i~0#1 > 0); 3497#L12 assume !(1 == main_~i~0#1); 3498#L15 assume !(10 == main_~i~0#1); 3518#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3548#L11 assume true; 3547#L11-1 assume !!(main_~i~0#1 > 0); 3490#L12 assume !(1 == main_~i~0#1); 3491#L15 assume !(10 == main_~i~0#1); 3486#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3487#L11 assume true; 3530#L11-1 assume !!(main_~i~0#1 > 0); 3481#L12 assume !(1 == main_~i~0#1); 3482#L15 assume !(10 == main_~i~0#1); 3521#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3537#L11 assume true; 3476#L11-1 assume !!(main_~i~0#1 > 0); 3474#L12 assume !(1 == main_~i~0#1); 3475#L15 assume !(10 == main_~i~0#1); 3470#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3471#L11 assume true; 3466#L11-1 assume !!(main_~i~0#1 > 0); 3467#L12 assume !(1 == main_~i~0#1); 3519#L15 assume !(10 == main_~i~0#1); 3457#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3456#L11 assume true; 3414#L11-1 assume !!(main_~i~0#1 > 0); 3415#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3391#L15 assume !(10 == main_~i~0#1); 3390#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3376#L11 [2024-11-10 22:34:16,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1215484386, now seen corresponding path program 4 times [2024-11-10 22:34:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742973102] [2024-11-10 22:34:16,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:16,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1365475742, now seen corresponding path program 3 times [2024-11-10 22:34:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230301656] [2024-11-10 22:34:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:16,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1372294779, now seen corresponding path program 1 times [2024-11-10 22:34:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:16,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031414780] [2024-11-10 22:34:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 137 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-10 22:34:16,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031414780] [2024-11-10 22:34:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031414780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430945080] [2024-11-10 22:34:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:16,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:16,929 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:16,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-10 22:34:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:16,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:16,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 137 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-10 22:34:16,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 137 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-10 22:34:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430945080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:17,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 22:34:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521970856] [2024-11-10 22:34:17,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:17,166 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:17,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:17,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:17,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:17,167 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:17,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:17,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:17,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-11-10 22:34:17,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:17,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:17,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,225 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:17,225 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:17,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,228 INFO L229 MonitoredProcess]: Starting monitored process 44 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-10 22:34:17,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-10 22:34:17,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:17,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:17,253 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:17,253 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:17,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-10 22:34:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,272 INFO L229 MonitoredProcess]: Starting monitored process 45 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-10 22:34:17,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-10 22:34:17,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:17,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:17,299 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:17,299 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:17,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,316 INFO L229 MonitoredProcess]: Starting monitored process 46 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-10 22:34:17,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-10 22:34:17,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:17,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:17,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,359 INFO L229 MonitoredProcess]: Starting monitored process 47 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-10 22:34:17,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-10 22:34:17,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:17,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:17,375 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:17,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,385 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:17,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:17,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:17,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:17,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:17,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:17,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:17,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-11-10 22:34:17,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:17,386 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:17,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:17,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:17,428 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:17,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,432 INFO L229 MonitoredProcess]: Starting monitored process 48 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-10 22:34:17,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-10 22:34:17,433 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-10 22:34:17,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:17,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:17,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:17,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:17,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:17,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:17,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:17,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,460 INFO L229 MonitoredProcess]: Starting monitored process 49 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-10 22:34:17,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-10 22:34:17,462 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-10 22:34:17,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:17,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:17,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:17,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:17,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:17,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:17,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:17,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,487 INFO L229 MonitoredProcess]: Starting monitored process 50 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-10 22:34:17,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-10 22:34:17,489 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-10 22:34:17,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:17,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:17,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:17,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:17,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:17,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:17,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:17,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:17,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,513 INFO L229 MonitoredProcess]: Starting monitored process 51 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-10 22:34:17,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-10 22:34:17,514 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-10 22:34:17,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:17,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:17,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:17,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:17,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:17,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:17,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:17,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:17,528 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:17,529 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:34:17,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:17,530 INFO L229 MonitoredProcess]: Starting monitored process 52 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-10 22:34:17,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-10 22:34:17,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:17,531 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:17,531 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:17,532 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:34:17,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:17,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:17,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:17,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:17,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:17,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:34:17,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:17,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 22:34:17,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 236 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:17,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 236 transitions. cyclomatic complexity: 41. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 463 states and 535 transitions. Complement of second has 7 states. [2024-11-10 22:34:17,703 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-10 22:34:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2024-11-10 22:34:17,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 12 letters. Loop has 50 letters. [2024-11-10 22:34:17,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:17,704 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:17,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:17,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:17,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:34:17,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:17,826 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-10 22:34:17,827 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 204 states and 236 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:17,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 204 states and 236 transitions. cyclomatic complexity: 41. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 476 states and 552 transitions. Complement of second has 9 states. [2024-11-10 22:34:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2024-11-10 22:34:17,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 12 letters. Loop has 50 letters. [2024-11-10 22:34:17,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:17,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 62 letters. Loop has 50 letters. [2024-11-10 22:34:17,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:17,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 12 letters. Loop has 100 letters. [2024-11-10 22:34:17,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:17,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 476 states and 552 transitions. [2024-11-10 22:34:17,879 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2024-11-10 22:34:17,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 476 states to 455 states and 527 transitions. [2024-11-10 22:34:17,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2024-11-10 22:34:17,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2024-11-10 22:34:17,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 455 states and 527 transitions. [2024-11-10 22:34:17,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:17,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 455 states and 527 transitions. [2024-11-10 22:34:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 527 transitions. [2024-11-10 22:34:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 354. [2024-11-10 22:34:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 354 states have (on average 1.1581920903954803) internal successors, (410), 353 states have internal predecessors, (410), 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-10 22:34:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 410 transitions. [2024-11-10 22:34:17,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 354 states and 410 transitions. [2024-11-10 22:34:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 22:34:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 22:34:17,889 INFO L87 Difference]: Start difference. First operand 354 states and 410 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10 22:34:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:17,914 INFO L93 Difference]: Finished difference Result 227 states and 265 transitions. [2024-11-10 22:34:17,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 265 transitions. [2024-11-10 22:34:17,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-10 22:34:17,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 197 states and 231 transitions. [2024-11-10 22:34:17,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-10 22:34:17,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-10 22:34:17,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 231 transitions. [2024-11-10 22:34:17,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:17,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 231 transitions. [2024-11-10 22:34:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 231 transitions. [2024-11-10 22:34:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 162. [2024-11-10 22:34:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.154320987654321) internal successors, (187), 161 states have internal predecessors, (187), 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-10 22:34:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2024-11-10 22:34:17,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 187 transitions. [2024-11-10 22:34:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:34:17,922 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 187 transitions. [2024-11-10 22:34:17,922 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-10 22:34:17,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 187 transitions. [2024-11-10 22:34:17,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2024-11-10 22:34:17,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:17,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:17,924 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 1, 1, 1] [2024-11-10 22:34:17,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 12, 12, 9, 4, 1, 1] [2024-11-10 22:34:17,925 INFO L745 eck$LassoCheckResult]: Stem: 5863#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5864#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5869#L11 assume true; 5967#L11-1 assume !!(main_~i~0#1 > 0); 5877#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5878#L15 assume !(10 == main_~i~0#1); 5871#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5912#L11 assume true; 5911#L11-1 assume !!(main_~i~0#1 > 0); 5902#L12 assume !(1 == main_~i~0#1); 5900#L15 assume !(10 == main_~i~0#1); 5901#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5896#L11 assume true; 5897#L11-1 assume !!(main_~i~0#1 > 0); 5893#L12 assume !(1 == main_~i~0#1); 5891#L15 assume !(10 == main_~i~0#1); 5892#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5888#L11 assume true; 5889#L11-1 assume !!(main_~i~0#1 > 0); 5884#L12 assume !(1 == main_~i~0#1); 5885#L15 assume !(10 == main_~i~0#1); 6020#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5873#L11 [2024-11-10 22:34:17,926 INFO L747 eck$LassoCheckResult]: Loop: 5873#L11 assume true; 5874#L11-1 assume !!(main_~i~0#1 > 0); 5875#L12 assume !(1 == main_~i~0#1); 5876#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5881#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5882#L11 assume true; 5960#L11-1 assume !!(main_~i~0#1 > 0); 5961#L12 assume !(1 == main_~i~0#1); 5954#L15 assume !(10 == main_~i~0#1); 5953#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5952#L11 assume true; 5951#L11-1 assume !!(main_~i~0#1 > 0); 5950#L12 assume !(1 == main_~i~0#1); 5949#L15 assume !(10 == main_~i~0#1); 5948#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5947#L11 assume true; 5946#L11-1 assume !!(main_~i~0#1 > 0); 5945#L12 assume !(1 == main_~i~0#1); 5944#L15 assume !(10 == main_~i~0#1); 5943#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5942#L11 assume true; 5941#L11-1 assume !!(main_~i~0#1 > 0); 5940#L12 assume !(1 == main_~i~0#1); 5939#L15 assume !(10 == main_~i~0#1); 5938#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5937#L11 assume true; 5936#L11-1 assume !!(main_~i~0#1 > 0); 5935#L12 assume !(1 == main_~i~0#1); 5934#L15 assume !(10 == main_~i~0#1); 5933#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5932#L11 assume true; 5931#L11-1 assume !!(main_~i~0#1 > 0); 5930#L12 assume !(1 == main_~i~0#1); 5929#L15 assume !(10 == main_~i~0#1); 5928#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5927#L11 assume true; 5926#L11-1 assume !!(main_~i~0#1 > 0); 5925#L12 assume !(1 == main_~i~0#1); 5924#L15 assume !(10 == main_~i~0#1); 5923#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5922#L11 assume true; 5921#L11-1 assume !!(main_~i~0#1 > 0); 5920#L12 assume !(1 == main_~i~0#1); 5915#L15 assume !(10 == main_~i~0#1); 5918#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5917#L11 assume true; 5916#L11-1 assume !!(main_~i~0#1 > 0); 5914#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5913#L15 assume !(10 == main_~i~0#1); 5906#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5905#L11 assume true; 5903#L11-1 assume !!(main_~i~0#1 > 0); 5904#L12 assume !(1 == main_~i~0#1); 5910#L15 assume !(10 == main_~i~0#1); 5898#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5899#L11 assume true; 5894#L11-1 assume !!(main_~i~0#1 > 0); 5895#L12 assume !(1 == main_~i~0#1); 5909#L15 assume !(10 == main_~i~0#1); 5890#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5880#L11 assume true; 5886#L11-1 assume !!(main_~i~0#1 > 0); 5887#L12 assume !(1 == main_~i~0#1); 5883#L15 assume !(10 == main_~i~0#1); 5879#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5873#L11 [2024-11-10 22:34:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 177806049, now seen corresponding path program 1 times [2024-11-10 22:34:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006375231] [2024-11-10 22:34:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:17,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:17,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:17,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash -249946136, now seen corresponding path program 4 times [2024-11-10 22:34:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:17,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322358311] [2024-11-10 22:34:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:17,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:17,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1057710344, now seen corresponding path program 2 times [2024-11-10 22:34:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382695858] [2024-11-10 22:34:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 304 proven. 34 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-10 22:34:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382695858] [2024-11-10 22:34:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382695858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842386822] [2024-11-10 22:34:18,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:34:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:18,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,054 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:18,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-11-10 22:34:18,093 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:34:18,093 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:18,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:18,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 304 proven. 34 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-10 22:34:18,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 304 proven. 34 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-10 22:34:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842386822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:18,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-10 22:34:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433213167] [2024-11-10 22:34:18,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:18,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:18,413 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:18,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:18,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:18,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:18,413 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:18,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,413 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:18,413 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:18,413 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-11-10 22:34:18,413 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:18,413 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:18,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,453 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:18,453 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:18,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,455 INFO L229 MonitoredProcess]: Starting monitored process 54 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-10 22:34:18,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-10 22:34:18,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:18,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:18,473 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:18,474 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_14=1} Honda state: {v_rep~unnamed0~0~true_14=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:18,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-10 22:34:18,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,485 INFO L229 MonitoredProcess]: Starting monitored process 55 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-10 22:34:18,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-10 22:34:18,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:18,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:18,504 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:18,504 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_14=0} Honda state: {v_rep~unnamed0~0~false_14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:18,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,516 INFO L229 MonitoredProcess]: Starting monitored process 56 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-10 22:34:18,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-10 22:34:18,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:18,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:18,529 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:18,529 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:18,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-10 22:34:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,540 INFO L229 MonitoredProcess]: Starting monitored process 57 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-10 22:34:18,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-10 22:34:18,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:18,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:18,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-10 22:34:18,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,564 INFO L229 MonitoredProcess]: Starting monitored process 58 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-10 22:34:18,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-10 22:34:18,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:18,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:18,578 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:18,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:18,589 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:18,589 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:18,589 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:18,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:18,589 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:18,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,589 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:18,589 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:18,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-11-10 22:34:18,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:18,589 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:18,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:18,629 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:18,630 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,631 INFO L229 MonitoredProcess]: Starting monitored process 59 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-10 22:34:18,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-10 22:34:18,632 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-10 22:34:18,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:18,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:18,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:18,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:18,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:18,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:18,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:18,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-10 22:34:18,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,667 INFO L229 MonitoredProcess]: Starting monitored process 60 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-10 22:34:18,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-10 22:34:18,669 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-10 22:34:18,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:18,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:18,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:18,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:18,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:18,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:18,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:18,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:18,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-10 22:34:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,694 INFO L229 MonitoredProcess]: Starting monitored process 61 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-10 22:34:18,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-10 22:34:18,695 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-10 22:34:18,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:18,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:18,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:18,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:18,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:18,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:18,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:18,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-10 22:34:18,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,721 INFO L229 MonitoredProcess]: Starting monitored process 62 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-10 22:34:18,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-10 22:34:18,722 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-10 22:34:18,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:18,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:18,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:18,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:18,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:18,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:18,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:18,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:18,738 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:18,738 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:34:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:18,739 INFO L229 MonitoredProcess]: Starting monitored process 63 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-10 22:34:18,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-10 22:34:18,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:18,740 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:18,740 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:18,741 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:34:18,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-10 22:34:18,751 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:18,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:18,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:18,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:34:18,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 56 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:18,977 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-10 22:34:18,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:18,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 187 states and 216 transitions. Complement of second has 5 states. [2024-11-10 22:34:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-10 22:34:18,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 22 letters. Loop has 65 letters. [2024-11-10 22:34:18,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:18,993 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 56 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:19,207 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-10 22:34:19,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:19,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 187 states and 216 transitions. Complement of second has 5 states. [2024-11-10 22:34:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-10 22:34:19,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 22 letters. Loop has 65 letters. [2024-11-10 22:34:19,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:19,220 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 56 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:19,435 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 6 loop predicates [2024-11-10 22:34:19,435 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:19,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 249 states and 287 transitions. Complement of second has 6 states. [2024-11-10 22:34:19,463 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-10 22:34:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-10 22:34:19,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 22 letters. Loop has 65 letters. [2024-11-10 22:34:19,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:19,465 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:19,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 56 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:19,688 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-10 22:34:19,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:19,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 187 transitions. cyclomatic complexity: 31. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 259 states and 297 transitions. Complement of second has 8 states. [2024-11-10 22:34:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2024-11-10 22:34:19,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 22 letters. Loop has 65 letters. [2024-11-10 22:34:19,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:19,734 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:19,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:19,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:34:19,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:19,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 56 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 22:34:19,947 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-11-10 22:34:19,948 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 162 states and 187 transitions. cyclomatic complexity: 31 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:20,198 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 162 states and 187 transitions. cyclomatic complexity: 31 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 2228 states and 3081 transitions. Complement of second has 118 states 15 powerset states103 rank states. The highest rank that occured is 5 [2024-11-10 22:34:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 22:34:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-11-10 22:34:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 22 letters. Loop has 65 letters. [2024-11-10 22:34:20,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 87 letters. Loop has 65 letters. [2024-11-10 22:34:20,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:20,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 22 letters. Loop has 130 letters. [2024-11-10 22:34:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:20,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2228 states and 3081 transitions. [2024-11-10 22:34:20,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 125 [2024-11-10 22:34:20,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2228 states to 1463 states and 2126 transitions. [2024-11-10 22:34:20,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2024-11-10 22:34:20,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325 [2024-11-10 22:34:20,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1463 states and 2126 transitions. [2024-11-10 22:34:20,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:20,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1463 states and 2126 transitions. [2024-11-10 22:34:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states and 2126 transitions. [2024-11-10 22:34:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 754. [2024-11-10 22:34:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.4549071618037135) internal successors, (1097), 753 states have internal predecessors, (1097), 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-10 22:34:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1097 transitions. [2024-11-10 22:34:20,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1097 transitions. [2024-11-10 22:34:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 22:34:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-10 22:34:20,316 INFO L87 Difference]: Start difference. First operand 754 states and 1097 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-10 22:34:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:20,380 INFO L93 Difference]: Finished difference Result 1391 states and 2095 transitions. [2024-11-10 22:34:20,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1391 states and 2095 transitions. [2024-11-10 22:34:20,388 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 157 [2024-11-10 22:34:20,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1391 states to 1306 states and 1938 transitions. [2024-11-10 22:34:20,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2024-11-10 22:34:20,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2024-11-10 22:34:20,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1306 states and 1938 transitions. [2024-11-10 22:34:20,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:20,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1306 states and 1938 transitions. [2024-11-10 22:34:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states and 1938 transitions. [2024-11-10 22:34:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 999. [2024-11-10 22:34:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 999 states have (on average 1.4514514514514514) internal successors, (1450), 998 states have internal predecessors, (1450), 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-10 22:34:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1450 transitions. [2024-11-10 22:34:20,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 999 states and 1450 transitions. [2024-11-10 22:34:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 22:34:20,414 INFO L425 stractBuchiCegarLoop]: Abstraction has 999 states and 1450 transitions. [2024-11-10 22:34:20,414 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-10 22:34:20,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 999 states and 1450 transitions. [2024-11-10 22:34:20,418 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2024-11-10 22:34:20,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:20,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:20,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 8, 1, 1, 1] [2024-11-10 22:34:20,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 17, 17, 9, 9, 1, 1] [2024-11-10 22:34:20,423 INFO L745 eck$LassoCheckResult]: Stem: 13303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13304#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 13305#L11 assume true; 13301#L11-1 assume !!(main_~i~0#1 > 0); 13302#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13722#L15 assume !(10 == main_~i~0#1); 13721#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13720#L11 assume true; 13719#L11-1 assume !!(main_~i~0#1 > 0); 13718#L12 assume !(1 == main_~i~0#1); 13717#L15 assume !(10 == main_~i~0#1); 13716#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13715#L11 assume true; 13714#L11-1 assume !!(main_~i~0#1 > 0); 13713#L12 assume !(1 == main_~i~0#1); 13712#L15 assume !(10 == main_~i~0#1); 13711#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13710#L11 assume true; 13709#L11-1 assume !!(main_~i~0#1 > 0); 13708#L12 assume !(1 == main_~i~0#1); 13707#L15 assume !(10 == main_~i~0#1); 13706#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13705#L11 assume true; 13704#L11-1 assume !!(main_~i~0#1 > 0); 13703#L12 assume !(1 == main_~i~0#1); 13702#L15 assume !(10 == main_~i~0#1); 13701#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13700#L11 assume true; 13699#L11-1 assume !!(main_~i~0#1 > 0); 13698#L12 assume !(1 == main_~i~0#1); 13697#L15 assume !(10 == main_~i~0#1); 13696#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13695#L11 assume true; 13694#L11-1 assume !!(main_~i~0#1 > 0); 13693#L12 assume !(1 == main_~i~0#1); 13692#L15 assume !(10 == main_~i~0#1); 13691#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13690#L11 assume true; 13689#L11-1 assume !!(main_~i~0#1 > 0); 13688#L12 assume !(1 == main_~i~0#1); 13687#L15 assume !(10 == main_~i~0#1); 13686#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13682#L11 assume true; 13685#L11-1 assume !!(main_~i~0#1 > 0); 13684#L12 assume !(1 == main_~i~0#1); 13683#L15 assume !(10 == main_~i~0#1); 13681#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13676#L11 assume true; 13677#L11-1 [2024-11-10 22:34:20,423 INFO L747 eck$LassoCheckResult]: Loop: 13677#L11-1 assume !!(main_~i~0#1 > 0); 13314#L12 assume !(1 == main_~i~0#1); 13315#L15 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13357#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13310#L11 assume true; 13311#L11-1 assume !!(main_~i~0#1 > 0); 14233#L12 assume !(1 == main_~i~0#1); 14231#L15 assume !(10 == main_~i~0#1); 14229#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14227#L11 assume true; 14225#L11-1 assume !!(main_~i~0#1 > 0); 14223#L12 assume !(1 == main_~i~0#1); 14221#L15 assume !(10 == main_~i~0#1); 14219#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14217#L11 assume true; 14215#L11-1 assume !!(main_~i~0#1 > 0); 14213#L12 assume !(1 == main_~i~0#1); 14211#L15 assume !(10 == main_~i~0#1); 14209#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14207#L11 assume true; 14205#L11-1 assume !!(main_~i~0#1 > 0); 14203#L12 assume !(1 == main_~i~0#1); 14201#L15 assume !(10 == main_~i~0#1); 14199#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14197#L11 assume true; 14195#L11-1 assume !!(main_~i~0#1 > 0); 14193#L12 assume !(1 == main_~i~0#1); 14191#L15 assume !(10 == main_~i~0#1); 14189#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14187#L11 assume true; 14185#L11-1 assume !!(main_~i~0#1 > 0); 14183#L12 assume !(1 == main_~i~0#1); 14181#L15 assume !(10 == main_~i~0#1); 14179#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14177#L11 assume true; 14175#L11-1 assume !!(main_~i~0#1 > 0); 14173#L12 assume !(1 == main_~i~0#1); 14171#L15 assume !(10 == main_~i~0#1); 14169#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14167#L11 assume true; 14165#L11-1 assume !!(main_~i~0#1 > 0); 14163#L12 assume !(1 == main_~i~0#1); 14138#L15 assume !(10 == main_~i~0#1); 14161#L18 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 14159#L11 assume true; 14157#L11-1 assume !!(main_~i~0#1 > 0); 14137#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 14125#L15 assume !(10 == main_~i~0#1); 14121#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 14122#L11 assume true; 14118#L11-1 assume !!(main_~i~0#1 > 0); 14119#L12 assume !(1 == main_~i~0#1); 14135#L15 assume !(10 == main_~i~0#1); 14113#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 14114#L11 assume true; 14109#L11-1 assume !!(main_~i~0#1 > 0); 14110#L12 assume !(1 == main_~i~0#1); 14141#L15 assume !(10 == main_~i~0#1); 14154#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 14153#L11 assume true; 14152#L11-1 assume !!(main_~i~0#1 > 0); 14139#L12 assume !(1 == main_~i~0#1); 14140#L15 assume !(10 == main_~i~0#1); 14099#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 14100#L11 assume true; 14096#L11-1 assume !!(main_~i~0#1 > 0); 14097#L12 assume !(1 == main_~i~0#1); 13943#L15 assume !(10 == main_~i~0#1); 13941#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13940#L11 assume true; 13926#L11-1 assume !!(main_~i~0#1 > 0); 13927#L12 assume !(1 == main_~i~0#1); 14136#L15 assume !(10 == main_~i~0#1); 14145#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 14144#L11 assume true; 13912#L11-1 assume !!(main_~i~0#1 > 0); 13913#L12 assume !(1 == main_~i~0#1); 14131#L15 assume !(10 == main_~i~0#1); 13904#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 14151#L11 assume true; 13889#L11-1 assume !!(main_~i~0#1 > 0); 13890#L12 assume !(1 == main_~i~0#1); 14132#L15 assume !(10 == main_~i~0#1); 13882#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13319#L11 assume true; 13874#L11-1 assume !!(main_~i~0#1 > 0); 13875#L12 assume !(1 == main_~i~0#1); 13866#L15 assume !(10 == main_~i~0#1); 13729#L18 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13724#L11 assume true; 13677#L11-1 [2024-11-10 22:34:20,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -822124826, now seen corresponding path program 2 times [2024-11-10 22:34:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:20,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020967636] [2024-11-10 22:34:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:20,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 268153412, now seen corresponding path program 5 times [2024-11-10 22:34:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177274341] [2024-11-10 22:34:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:20,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2021516521, now seen corresponding path program 3 times [2024-11-10 22:34:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:20,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287146812] [2024-11-10 22:34:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:20,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:34:20 BoogieIcfgContainer [2024-11-10 22:34:20,943 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:34:20,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:34:20,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:34:20,943 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:34:20,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:11" (3/4) ... [2024-11-10 22:34:20,950 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:34:20,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:34:20,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:34:20,998 INFO L158 Benchmark]: Toolchain (without parser) took 10424.60ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 78.0MB in the beginning and 143.2MB in the end (delta: -65.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-10 22:34:20,998 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:20,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.49ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 77.8MB in the beginning and 164.5MB in the end (delta: -86.6MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-10 22:34:20,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.93ms. Allocated memory is still 192.9MB. Free memory was 164.5MB in the beginning and 163.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:20,999 INFO L158 Benchmark]: Boogie Preprocessor took 19.43ms. Allocated memory is still 192.9MB. Free memory was 162.4MB in the beginning and 161.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:20,999 INFO L158 Benchmark]: IcfgBuilder took 264.71ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 151.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 22:34:20,999 INFO L158 Benchmark]: BuchiAutomizer took 9823.03ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 151.9MB in the beginning and 147.4MB in the end (delta: 4.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-10 22:34:21,000 INFO L158 Benchmark]: Witness Printer took 54.25ms. Allocated memory is still 232.8MB. Free memory was 147.4MB in the beginning and 143.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 22:34:21,001 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.20ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.49ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 77.8MB in the beginning and 164.5MB in the end (delta: -86.6MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.93ms. Allocated memory is still 192.9MB. Free memory was 164.5MB in the beginning and 163.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.43ms. Allocated memory is still 192.9MB. Free memory was 162.4MB in the beginning and 161.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.71ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 151.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9823.03ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 151.9MB in the beginning and 147.4MB in the end (delta: 4.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 54.25ms. Allocated memory is still 232.8MB. Free memory was 147.4MB in the beginning and 143.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 15 terminating modules (8 trivial, 5 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 3) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 5 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 8 locations. One nondeterministic module has affine ranking function i and consists of 9 locations. 8 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 999 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 13 iterations. TraceHistogramMax:18. Analysis of lassos took 6.0s. Construction of modules took 0.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 5. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1408 StatesRemovedByMinimization, 14 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 [4, 1, 0, 1, 1]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 524/615 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 245 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT3 conc0 concLT2 SILN0 SILU0 SILI1 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax186 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq194 hnf90 smp91 dnf117 smp97 tf110 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 79ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] Loop: [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] Loop: [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:34:21,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:21,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2024-11-10 22:34:21,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:21,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:21,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)