./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:47:14,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:47:14,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:47:14,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:47:14,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:47:14,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:47:14,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:47:14,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:47:14,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:47:14,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:47:14,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:47:14,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:47:14,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:47:14,452 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:47:14,452 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:47:14,452 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:47:14,453 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:47:14,453 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:47:14,453 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:47:14,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:47:14,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:47:14,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:47:14,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:47:14,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:47:14,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:47:14,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:47:14,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:47:14,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:47:14,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:47:14,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:47:14,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:47:14,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:47:14,459 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:47:14,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:47:14,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:47:14,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:47:14,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:47:14,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:47:14,461 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:47:14,461 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 [2024-11-19 14:47:14,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:47:14,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:47:14,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:47:14,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:47:14,707 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:47:14,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c [2024-11-19 14:47:16,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:47:16,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:47:16,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-11-19 14:47:16,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abbb63dc7/9fe773d60a7444a6b75890205ef02d65/FLAG6e5873296 [2024-11-19 14:47:16,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abbb63dc7/9fe773d60a7444a6b75890205ef02d65 [2024-11-19 14:47:16,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:47:16,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:47:16,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:47:16,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:47:16,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:47:16,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2aa8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16, skipping insertion in model container [2024-11-19 14:47:16,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:47:16,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:47:16,766 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:47:16,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:47:16,808 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:47:16,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16 WrapperNode [2024-11-19 14:47:16,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:47:16,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:47:16,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:47:16,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:47:16,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,858 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-19 14:47:16,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:47:16,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:47:16,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:47:16,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:47:16,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,877 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:47:16,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:47:16,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:47:16,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:47:16,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:47:16,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (1/1) ... [2024-11-19 14:47:16,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:16,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:16,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:16,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:47:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:47:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:47:16,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:47:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:47:17,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:47:17,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:47:17,083 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-19 14:47:17,083 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:47:17,093 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:47:17,093 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:47:17,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:17 BoogieIcfgContainer [2024-11-19 14:47:17,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:47:17,094 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:47:17,094 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:47:17,097 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:47:17,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:17,098 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:47:16" (1/3) ... [2024-11-19 14:47:17,098 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43009e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:47:17, skipping insertion in model container [2024-11-19 14:47:17,098 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:17,098 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:16" (2/3) ... [2024-11-19 14:47:17,099 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43009e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:47:17, skipping insertion in model container [2024-11-19 14:47:17,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:17,099 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:17" (3/3) ... [2024-11-19 14:47:17,100 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c [2024-11-19 14:47:17,146 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:47:17,147 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:47:17,147 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:47:17,147 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:47:17,147 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:47:17,148 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:47:17,148 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:47:17,148 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:47:17,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:47:17,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:17,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:47:17,172 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:47:17,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:47:17,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:17,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:47:17,180 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3#L21-3true [2024-11-19 14:47:17,181 INFO L747 eck$LassoCheckResult]: Loop: 3#L21-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L22-3true assume !(main_~b~0#1 < 6); 13#L21-2true main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3#L21-3true [2024-11-19 14:47:17,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:47:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724798319] [2024-11-19 14:47:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash 39933, now seen corresponding path program 1 times [2024-11-19 14:47:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126731582] [2024-11-19 14:47:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126731582] [2024-11-19 14:47:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126731582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:17,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:17,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:47:17,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803614158] [2024-11-19 14:47:17,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:17,354 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:17,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:47:17,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:47:17,387 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:17,414 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-19 14:47:17,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-19 14:47:17,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-19 14:47:17,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 15 transitions. [2024-11-19 14:47:17,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:47:17,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:47:17,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-11-19 14:47:17,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:17,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-19 14:47:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-11-19 14:47:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2024-11-19 14:47:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-19 14:47:17,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-19 14:47:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:47:17,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-19 14:47:17,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:47:17,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-19 14:47:17,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:47:17,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:17,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:47:17,442 INFO L745 eck$LassoCheckResult]: Stem: 44#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 40#L21-3 [2024-11-19 14:47:17,442 INFO L747 eck$LassoCheckResult]: Loop: 40#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 41#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 43#L23-3 assume !(main_~c~0#1 < 6); 47#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 48#L22-3 assume !(main_~b~0#1 < 6); 46#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 40#L21-3 [2024-11-19 14:47:17,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:47:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402010186] [2024-11-19 14:47:17,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,449 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:17,449 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:17,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1191164837, now seen corresponding path program 1 times [2024-11-19 14:47:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441229674] [2024-11-19 14:47:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:17,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441229674] [2024-11-19 14:47:17,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441229674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:17,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:17,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:47:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030865940] [2024-11-19 14:47:17,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:17,478 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:17,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:47:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:47:17,479 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:17,486 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2024-11-19 14:47:17,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2024-11-19 14:47:17,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:47:17,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2024-11-19 14:47:17,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:47:17,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:47:17,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-19 14:47:17,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:17,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-19 14:47:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-19 14:47:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-19 14:47:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-11-19 14:47:17,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-19 14:47:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:47:17,490 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-19 14:47:17,490 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:47:17,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-11-19 14:47:17,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:47:17,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:17,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:17,491 INFO L745 eck$LassoCheckResult]: Stem: 70#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 71#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 66#L21-3 [2024-11-19 14:47:17,492 INFO L747 eck$LassoCheckResult]: Loop: 66#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 67#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 72#L23-3 assume !!(main_~c~0#1 < 6); 68#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 69#L23-3 assume !(main_~c~0#1 < 6); 74#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 75#L22-3 assume !(main_~b~0#1 < 6); 73#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 66#L21-3 [2024-11-19 14:47:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:47:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749100051] [2024-11-19 14:47:17,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,504 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:47:17,504 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:17,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1993060441, now seen corresponding path program 1 times [2024-11-19 14:47:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008681663] [2024-11-19 14:47:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008681663] [2024-11-19 14:47:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008681663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524900630] [2024-11-19 14:47:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 14:47:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524900630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:17,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:17,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 14:47:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156659946] [2024-11-19 14:47:17,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:17,618 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:17,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:47:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:47:17,619 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:17,637 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-19 14:47:17,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-11-19 14:47:17,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-19 14:47:17,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2024-11-19 14:47:17,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:47:17,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-19 14:47:17,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2024-11-19 14:47:17,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:17,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-19 14:47:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2024-11-19 14:47:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 14:47:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-19 14:47:17,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-19 14:47:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:47:17,641 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-19 14:47:17,641 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:47:17,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-11-19 14:47:17,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-19 14:47:17,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:17,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:17,642 INFO L745 eck$LassoCheckResult]: Stem: 147#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 143#L21-3 [2024-11-19 14:47:17,642 INFO L747 eck$LassoCheckResult]: Loop: 143#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 144#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 149#L23-3 assume !!(main_~c~0#1 < 6); 145#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 146#L23-3 assume !!(main_~c~0#1 < 6); 158#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 157#L23-3 assume !!(main_~c~0#1 < 6); 156#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 155#L23-3 assume !!(main_~c~0#1 < 6); 154#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 153#L23-3 assume !(main_~c~0#1 < 6); 151#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 152#L22-3 assume !(main_~b~0#1 < 6); 150#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 143#L21-3 [2024-11-19 14:47:17,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:47:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950630595] [2024-11-19 14:47:17,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,648 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:17,648 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:17,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1917011795, now seen corresponding path program 2 times [2024-11-19 14:47:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184218961] [2024-11-19 14:47:17,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:17,671 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 14:47:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184218961] [2024-11-19 14:47:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184218961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059494894] [2024-11-19 14:47:17,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:17,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:17,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:17,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 14:47:17,770 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:17,770 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:17,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059494894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:17,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:17,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2024-11-19 14:47:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137111265] [2024-11-19 14:47:17,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:17,870 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:47:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:47:17,871 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:17,999 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-19 14:47:17,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2024-11-19 14:47:18,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-19 14:47:18,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2024-11-19 14:47:18,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-19 14:47:18,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-19 14:47:18,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2024-11-19 14:47:18,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:18,003 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-11-19 14:47:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2024-11-19 14:47:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2024-11-19 14:47:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-19 14:47:18,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-19 14:47:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:47:18,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-19 14:47:18,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:47:18,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2024-11-19 14:47:18,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-19 14:47:18,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:18,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:18,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:18,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1] [2024-11-19 14:47:18,010 INFO L745 eck$LassoCheckResult]: Stem: 327#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 323#L21-3 [2024-11-19 14:47:18,011 INFO L747 eck$LassoCheckResult]: Loop: 323#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 324#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 348#L23-3 assume !!(main_~c~0#1 < 6); 347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 346#L23-3 assume !!(main_~c~0#1 < 6); 345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 344#L23-3 assume !!(main_~c~0#1 < 6); 343#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 342#L23-3 assume !!(main_~c~0#1 < 6); 341#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 340#L23-3 assume !!(main_~c~0#1 < 6); 339#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 338#L23-3 assume !!(main_~c~0#1 < 6); 337#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 336#L23-3 assume !(main_~c~0#1 < 6); 333#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 330#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 331#L23-3 assume !!(main_~c~0#1 < 6); 325#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 326#L23-3 assume !!(main_~c~0#1 < 6); 329#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 357#L23-3 assume !!(main_~c~0#1 < 6); 356#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 355#L23-3 assume !!(main_~c~0#1 < 6); 354#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 353#L23-3 assume !!(main_~c~0#1 < 6); 352#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 351#L23-3 assume !!(main_~c~0#1 < 6); 350#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 349#L23-3 assume !(main_~c~0#1 < 6); 335#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 334#L22-3 assume !(main_~b~0#1 < 6); 332#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 323#L21-3 [2024-11-19 14:47:18,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:47:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730934607] [2024-11-19 14:47:18,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:47:18,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,017 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:18,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:18,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:18,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:18,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1010871677, now seen corresponding path program 3 times [2024-11-19 14:47:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655618412] [2024-11-19 14:47:18,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,045 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 14:47:18,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 14:47:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655618412] [2024-11-19 14:47:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655618412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043892537] [2024-11-19 14:47:18,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:18,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:18,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:18,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:18,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 14:47:18,157 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 14:47:18,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:18,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 14:47:18,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 14:47:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043892537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:18,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 14:47:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470651460] [2024-11-19 14:47:18,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:18,303 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:47:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:47:18,304 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:18,358 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-19 14:47:18,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions. [2024-11-19 14:47:18,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-19 14:47:18,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 102 transitions. [2024-11-19 14:47:18,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-19 14:47:18,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-19 14:47:18,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-11-19 14:47:18,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:18,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-19 14:47:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-11-19 14:47:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 14:47:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-19 14:47:18,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-19 14:47:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:47:18,371 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-19 14:47:18,371 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:47:18,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions. [2024-11-19 14:47:18,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-19 14:47:18,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:18,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:18,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:18,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-11-19 14:47:18,375 INFO L745 eck$LassoCheckResult]: Stem: 660#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 656#L21-3 [2024-11-19 14:47:18,376 INFO L747 eck$LassoCheckResult]: Loop: 656#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 657#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 662#L23-3 assume !!(main_~c~0#1 < 6); 658#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 659#L23-3 assume !!(main_~c~0#1 < 6); 747#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 745#L23-3 assume !!(main_~c~0#1 < 6); 743#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 741#L23-3 assume !!(main_~c~0#1 < 6); 739#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 737#L23-3 assume !!(main_~c~0#1 < 6); 735#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 733#L23-3 assume !!(main_~c~0#1 < 6); 731#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 730#L23-3 assume !(main_~c~0#1 < 6); 664#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 665#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 750#L23-3 assume !!(main_~c~0#1 < 6); 749#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 748#L23-3 assume !!(main_~c~0#1 < 6); 746#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 744#L23-3 assume !!(main_~c~0#1 < 6); 742#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 740#L23-3 assume !!(main_~c~0#1 < 6); 738#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 736#L23-3 assume !!(main_~c~0#1 < 6); 734#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 732#L23-3 assume !!(main_~c~0#1 < 6); 729#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 728#L23-3 assume !(main_~c~0#1 < 6); 727#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 726#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 725#L23-3 assume !!(main_~c~0#1 < 6); 724#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 723#L23-3 assume !!(main_~c~0#1 < 6); 722#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 721#L23-3 assume !!(main_~c~0#1 < 6); 720#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 719#L23-3 assume !!(main_~c~0#1 < 6); 718#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 717#L23-3 assume !!(main_~c~0#1 < 6); 716#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 715#L23-3 assume !!(main_~c~0#1 < 6); 714#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 713#L23-3 assume !(main_~c~0#1 < 6); 712#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 711#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 710#L23-3 assume !!(main_~c~0#1 < 6); 709#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 708#L23-3 assume !!(main_~c~0#1 < 6); 707#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 706#L23-3 assume !!(main_~c~0#1 < 6); 705#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 704#L23-3 assume !!(main_~c~0#1 < 6); 703#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 702#L23-3 assume !!(main_~c~0#1 < 6); 701#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 700#L23-3 assume !!(main_~c~0#1 < 6); 699#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 698#L23-3 assume !(main_~c~0#1 < 6); 697#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 696#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 695#L23-3 assume !!(main_~c~0#1 < 6); 694#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 693#L23-3 assume !!(main_~c~0#1 < 6); 692#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 691#L23-3 assume !!(main_~c~0#1 < 6); 690#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 689#L23-3 assume !!(main_~c~0#1 < 6); 688#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 687#L23-3 assume !!(main_~c~0#1 < 6); 686#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 685#L23-3 assume !!(main_~c~0#1 < 6); 684#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 683#L23-3 assume !(main_~c~0#1 < 6); 682#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 681#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 667#L23-3 assume !!(main_~c~0#1 < 6); 680#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 679#L23-3 assume !!(main_~c~0#1 < 6); 678#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 677#L23-3 assume !!(main_~c~0#1 < 6); 676#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 675#L23-3 assume !!(main_~c~0#1 < 6); 674#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 673#L23-3 assume !!(main_~c~0#1 < 6); 672#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 671#L23-3 assume !!(main_~c~0#1 < 6); 670#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 669#L23-3 assume !(main_~c~0#1 < 6); 668#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 666#L22-3 assume !(main_~b~0#1 < 6); 663#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 656#L21-3 [2024-11-19 14:47:18,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:47:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958055063] [2024-11-19 14:47:18,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:47:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,384 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:47:18,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:18,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:18,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:18,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -655757187, now seen corresponding path program 4 times [2024-11-19 14:47:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098977569] [2024-11-19 14:47:18,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,415 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:18,416 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:18,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:18,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610245, now seen corresponding path program 1 times [2024-11-19 14:47:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498762388] [2024-11-19 14:47:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:18,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:18,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:19,224 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:19,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:19,225 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:19,225 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:19,225 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:19,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:19,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:19,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-11-19 14:47:19,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:19,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:19,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,292 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:19,293 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:19,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:19,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:47:19,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:19,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:19,312 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:19,312 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:19,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:47:19,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:19,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:47:19,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:19,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:19,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:47:19,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:19,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:47:19,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:19,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:19,391 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:19,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:19,395 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:19,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:19,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:19,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:19,396 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:19,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:19,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:19,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-11-19 14:47:19,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:19,396 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:19,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:19,467 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:19,475 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:19,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:47:19,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:47:19,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:19,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:19,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:19,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:19,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:19,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:19,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:19,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:19,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:19,513 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-19 14:47:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,518 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-19 14:47:19,519 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-19 14:47:19,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:19,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:19,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:19,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:19,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:19,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:19,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:19,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:19,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:19,545 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-19 14:47:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,547 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-19 14:47:19,548 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-19 14:47:19,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:19,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:19,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:19,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:19,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:19,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:19,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,573 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-19 14:47:19,574 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-19 14:47:19,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:19,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:19,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:19,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:19,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:19,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:19,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:19,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:19,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:19,600 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-19 14:47:19,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,603 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-19 14:47:19,605 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-19 14:47:19,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:19,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:19,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:19,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:19,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:19,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:19,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:19,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:19,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:19,626 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:19,626 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:19,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:19,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,629 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-19 14:47:19,630 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-19 14:47:19,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:19,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:19,632 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:19,632 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:19,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:19,648 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:19,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:19,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:19,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:19,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-19 14:47:20,210 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:20,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-19 14:47:20,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 188 states and 203 transitions. Complement of second has 4 states. [2024-11-19 14:47:20,244 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-19 14:47:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-19 14:47:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-19 14:47:20,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 93 letters. [2024-11-19 14:47:20,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:20,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 95 letters. Loop has 93 letters. [2024-11-19 14:47:20,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:20,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 186 letters. [2024-11-19 14:47:20,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:20,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 203 transitions. [2024-11-19 14:47:20,257 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2024-11-19 14:47:20,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 187 states and 202 transitions. [2024-11-19 14:47:20,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-19 14:47:20,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-19 14:47:20,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 202 transitions. [2024-11-19 14:47:20,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:20,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 202 transitions. [2024-11-19 14:47:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 202 transitions. [2024-11-19 14:47:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-11-19 14:47:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.09009009009009) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-19 14:47:20,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-19 14:47:20,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-19 14:47:20,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:47:20,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions. [2024-11-19 14:47:20,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:47:20,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:20,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:20,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:47:20,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-19 14:47:20,272 INFO L745 eck$LassoCheckResult]: Stem: 1251#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1252#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1243#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1245#L22-3 [2024-11-19 14:47:20,272 INFO L747 eck$LassoCheckResult]: Loop: 1245#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1253#L23-3 assume !!(main_~c~0#1 < 6); 1247#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1248#L23-3 assume !!(main_~c~0#1 < 6); 1353#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1352#L23-3 assume !!(main_~c~0#1 < 6); 1351#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1350#L23-3 assume !!(main_~c~0#1 < 6); 1349#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1348#L23-3 assume !!(main_~c~0#1 < 6); 1347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1346#L23-3 assume !!(main_~c~0#1 < 6); 1345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1344#L23-3 assume !(main_~c~0#1 < 6); 1257#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 1245#L22-3 [2024-11-19 14:47:20,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-19 14:47:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291235554] [2024-11-19 14:47:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:20,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 1 times [2024-11-19 14:47:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596717673] [2024-11-19 14:47:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:20,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash 855328031, now seen corresponding path program 1 times [2024-11-19 14:47:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471317988] [2024-11-19 14:47:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:20,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:20,374 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:20,375 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:20,375 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:20,375 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:20,375 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:20,375 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,375 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:20,375 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:20,375 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-19 14:47:20,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:20,375 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:20,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:20,411 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:20,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,414 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-19 14:47:20,418 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-19 14:47:20,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:20,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:20,451 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-19 14:47:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,456 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-19 14:47:20,457 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-19 14:47:20,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:20,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:20,486 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:20,491 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-19 14:47:20,492 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:20,492 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:20,492 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:20,492 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:20,492 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:20,492 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,492 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:20,492 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:20,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-19 14:47:20,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:20,493 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:20,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:20,524 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:20,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,526 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-19 14:47:20,528 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-19 14:47:20,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:20,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:20,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:20,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:20,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:20,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:20,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:20,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:20,543 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:20,545 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:20,545 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:20,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,547 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-19 14:47:20,548 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-19 14:47:20,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:20,549 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:20,549 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:20,549 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:20,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:20,564 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:20,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:20,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:20,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:20,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:20,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:20,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:47:20,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:47:20,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:20,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:20,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 320 states and 348 transitions. Complement of second has 7 states. [2024-11-19 14:47:20,687 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-19 14:47:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-19 14:47:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 15 letters. [2024-11-19 14:47:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 18 letters. Loop has 15 letters. [2024-11-19 14:47:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 30 letters. [2024-11-19 14:47:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:20,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 348 transitions. [2024-11-19 14:47:20,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:47:20,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 233 states and 254 transitions. [2024-11-19 14:47:20,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-19 14:47:20,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-19 14:47:20,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 254 transitions. [2024-11-19 14:47:20,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:20,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 254 transitions. [2024-11-19 14:47:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 254 transitions. [2024-11-19 14:47:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2024-11-19 14:47:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1007751937984496) internal successors, (142), 128 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-11-19 14:47:20,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-19 14:47:20,710 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-19 14:47:20,710 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:47:20,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 142 transitions. [2024-11-19 14:47:20,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:47:20,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:20,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:20,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:47:20,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:47:20,713 INFO L745 eck$LassoCheckResult]: Stem: 1760#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1751#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1753#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1757#L23-3 [2024-11-19 14:47:20,713 INFO L747 eck$LassoCheckResult]: Loop: 1757#L23-3 assume !!(main_~c~0#1 < 6); 1756#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1757#L23-3 [2024-11-19 14:47:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-11-19 14:47:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:20,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247337815] [2024-11-19 14:47:20,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times [2024-11-19 14:47:20,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:20,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053373597] [2024-11-19 14:47:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:20,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 889666765, now seen corresponding path program 1 times [2024-11-19 14:47:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851602452] [2024-11-19 14:47:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:20,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:20,753 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:20,753 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:20,753 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:20,753 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:20,753 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:20,753 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,753 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:20,753 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:20,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-19 14:47:20,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:20,754 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:20,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,775 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:20,775 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:20,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,777 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-19 14:47:20,779 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-19 14:47:20,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:20,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:20,792 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:20,792 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:20,803 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-19 14:47:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,805 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-19 14:47:20,807 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-19 14:47:20,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:20,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:20,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,833 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-19 14:47:20,836 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-19 14:47:20,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:20,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:20,868 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:20,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:20,873 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:20,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:20,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:20,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:20,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:20,874 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,874 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:20,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:20,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-19 14:47:20,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:20,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:20,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:20,893 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:20,893 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:20,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,895 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-19 14:47:20,896 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-19 14:47:20,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:20,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:20,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:20,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:20,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:20,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:20,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:20,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:20,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:20,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:20,920 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:20,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:20,925 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-19 14:47:20,926 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-19 14:47:20,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:20,926 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:20,926 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:20,926 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:20,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-19 14:47:20,943 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:20,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:20,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:20,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:20,974 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:20,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:20,983 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:20,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,002 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 180 states and 199 transitions. Complement of second has 7 states. [2024-11-19 14:47:21,003 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-19 14:47:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-19 14:47:21,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:47:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:47:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-19 14:47:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 199 transitions. [2024-11-19 14:47:21,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:47:21,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 160 states and 175 transitions. [2024-11-19 14:47:21,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:47:21,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:47:21,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 175 transitions. [2024-11-19 14:47:21,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:21,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 175 transitions. [2024-11-19 14:47:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 175 transitions. [2024-11-19 14:47:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2024-11-19 14:47:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-11-19 14:47:21,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-19 14:47:21,017 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-19 14:47:21,018 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:47:21,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2024-11-19 14:47:21,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:47:21,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:21,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:21,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1] [2024-11-19 14:47:21,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:47:21,021 INFO L745 eck$LassoCheckResult]: Stem: 2110#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 2101#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2103#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2112#L23-3 assume !!(main_~c~0#1 < 6); 2108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2109#L23-3 assume !!(main_~c~0#1 < 6); 2228#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2226#L23-3 assume !!(main_~c~0#1 < 6); 2224#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2222#L23-3 assume !!(main_~c~0#1 < 6); 2220#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2218#L23-3 assume !!(main_~c~0#1 < 6); 2216#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2214#L23-3 assume !!(main_~c~0#1 < 6); 2211#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2210#L23-3 assume !(main_~c~0#1 < 6); 2207#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 2147#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2107#L23-3 [2024-11-19 14:47:21,021 INFO L747 eck$LassoCheckResult]: Loop: 2107#L23-3 assume !!(main_~c~0#1 < 6); 2106#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2107#L23-3 [2024-11-19 14:47:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash 745365203, now seen corresponding path program 2 times [2024-11-19 14:47:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377846096] [2024-11-19 14:47:21,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:21,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times [2024-11-19 14:47:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401630550] [2024-11-19 14:47:21,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,037 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:21,037 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash -963577515, now seen corresponding path program 3 times [2024-11-19 14:47:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577504702] [2024-11-19 14:47:21,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,051 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-19 14:47:21,051 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,086 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:21,087 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:21,087 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:21,087 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:21,087 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:21,087 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,087 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:21,087 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:21,087 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-19 14:47:21,087 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:21,087 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:21,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,158 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:21,159 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:21,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,163 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-19 14:47:21,164 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-19 14:47:21,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:21,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:21,179 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:47:21,179 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:47:21,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,192 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-19 14:47:21,197 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-19 14:47:21,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:21,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:21,220 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-19 14:47:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,222 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-19 14:47:21,223 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-19 14:47:21,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:21,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:21,272 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:21,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 14:47:21,277 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:21,277 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:21,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:21,277 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:21,277 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:21,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:21,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:21,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-19 14:47:21,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:21,277 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:21,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,309 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:21,309 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:21,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,318 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-19 14:47:21,322 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-19 14:47:21,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:21,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:21,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:21,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:21,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:21,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:21,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:21,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:21,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:21,346 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-19 14:47:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,347 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-19 14:47:21,348 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-19 14:47:21,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:21,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:21,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:21,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:21,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:21,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:21,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:21,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:21,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:21,364 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:21,364 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,365 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-19 14:47:21,366 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-19 14:47:21,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:21,367 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:21,367 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:21,367 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:21,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 14:47:21,379 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:21,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,418 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:21,429 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:21,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 176 states and 193 transitions. Complement of second has 7 states. [2024-11-19 14:47:21,446 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-19 14:47:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-19 14:47:21,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-19 14:47:21,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,447 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:47:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,485 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:21,493 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:21,493 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,504 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 176 states and 193 transitions. Complement of second has 7 states. [2024-11-19 14:47:21,507 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-19 14:47:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-19 14:47:21,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-19 14:47:21,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,508 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:47:21,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,541 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:21,552 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:21,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 200 states and 221 transitions. Complement of second has 6 states. [2024-11-19 14:47:21,568 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-19 14:47:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-19 14:47:21,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-19 14:47:21,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-19 14:47:21,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-19 14:47:21,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:21,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 221 transitions. [2024-11-19 14:47:21,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:47:21,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 112 states and 121 transitions. [2024-11-19 14:47:21,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:47:21,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:47:21,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2024-11-19 14:47:21,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:21,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-19 14:47:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2024-11-19 14:47:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-19 14:47:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.0810810810810811) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-19 14:47:21,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-19 14:47:21,574 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-19 14:47:21,574 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:47:21,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 120 transitions. [2024-11-19 14:47:21,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:47:21,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:21,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:21,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-11-19 14:47:21,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-19 14:47:21,577 INFO L745 eck$LassoCheckResult]: Stem: 3015#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3009#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3010#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3119#L23-3 assume !!(main_~c~0#1 < 6); 3118#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3117#L23-3 assume !!(main_~c~0#1 < 6); 3115#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3113#L23-3 assume !!(main_~c~0#1 < 6); 3111#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3109#L23-3 assume !!(main_~c~0#1 < 6); 3107#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3105#L23-3 assume !!(main_~c~0#1 < 6); 3103#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3101#L23-3 assume !!(main_~c~0#1 < 6); 3098#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3097#L23-3 assume !(main_~c~0#1 < 6); 3023#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3020#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3019#L23-3 assume !!(main_~c~0#1 < 6); 3013#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3014#L23-3 assume !!(main_~c~0#1 < 6); 3116#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3114#L23-3 assume !!(main_~c~0#1 < 6); 3112#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3110#L23-3 assume !!(main_~c~0#1 < 6); 3108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3106#L23-3 assume !!(main_~c~0#1 < 6); 3104#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3102#L23-3 assume !!(main_~c~0#1 < 6); 3100#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3099#L23-3 assume !(main_~c~0#1 < 6); 3096#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3095#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3094#L23-3 assume !!(main_~c~0#1 < 6); 3093#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3092#L23-3 assume !!(main_~c~0#1 < 6); 3091#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3090#L23-3 assume !!(main_~c~0#1 < 6); 3089#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3088#L23-3 assume !!(main_~c~0#1 < 6); 3087#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3086#L23-3 assume !!(main_~c~0#1 < 6); 3085#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3084#L23-3 assume !!(main_~c~0#1 < 6); 3083#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3082#L23-3 assume !(main_~c~0#1 < 6); 3081#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3080#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3079#L23-3 assume !!(main_~c~0#1 < 6); 3078#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3077#L23-3 assume !!(main_~c~0#1 < 6); 3076#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3075#L23-3 assume !!(main_~c~0#1 < 6); 3074#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3073#L23-3 assume !!(main_~c~0#1 < 6); 3072#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3071#L23-3 assume !!(main_~c~0#1 < 6); 3070#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3069#L23-3 assume !!(main_~c~0#1 < 6); 3068#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3067#L23-3 assume !(main_~c~0#1 < 6); 3066#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3065#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3064#L23-3 assume !!(main_~c~0#1 < 6); 3063#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3062#L23-3 assume !!(main_~c~0#1 < 6); 3061#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3060#L23-3 assume !!(main_~c~0#1 < 6); 3059#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3058#L23-3 assume !!(main_~c~0#1 < 6); 3057#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3056#L23-3 assume !!(main_~c~0#1 < 6); 3055#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3054#L23-3 assume !!(main_~c~0#1 < 6); 3053#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3052#L23-3 assume !(main_~c~0#1 < 6); 3051#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3050#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3027#L23-3 assume !!(main_~c~0#1 < 6); 3049#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3048#L23-3 assume !!(main_~c~0#1 < 6); 3047#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3046#L23-3 assume !!(main_~c~0#1 < 6); 3044#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3042#L23-3 assume !!(main_~c~0#1 < 6); 3040#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3038#L23-3 assume !!(main_~c~0#1 < 6); 3036#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3034#L23-3 assume !!(main_~c~0#1 < 6); 3031#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3030#L23-3 assume !(main_~c~0#1 < 6); 3028#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3026#L22-3 assume !(main_~b~0#1 < 6); 3021#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3011#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3012#L22-3 [2024-11-19 14:47:21,577 INFO L747 eck$LassoCheckResult]: Loop: 3012#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3017#L23-3 assume !!(main_~c~0#1 < 6); 3018#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3045#L23-3 assume !!(main_~c~0#1 < 6); 3043#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3041#L23-3 assume !!(main_~c~0#1 < 6); 3039#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3037#L23-3 assume !!(main_~c~0#1 < 6); 3035#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3033#L23-3 assume !!(main_~c~0#1 < 6); 3032#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3029#L23-3 assume !!(main_~c~0#1 < 6); 3025#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3024#L23-3 assume !(main_~c~0#1 < 6); 3022#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3012#L22-3 [2024-11-19 14:47:21,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1672375441, now seen corresponding path program 2 times [2024-11-19 14:47:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12593024] [2024-11-19 14:47:21,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:21,587 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 2 times [2024-11-19 14:47:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15361994] [2024-11-19 14:47:21,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:21,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350057, now seen corresponding path program 3 times [2024-11-19 14:47:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929928996] [2024-11-19 14:47:21,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,618 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2024-11-19 14:47:21,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:21,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,673 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:21,673 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:21,673 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:21,673 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:21,673 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:21,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:21,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:21,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-19 14:47:21,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:21,673 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:21,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,702 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:21,703 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,704 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-19 14:47:21,708 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-19 14:47:21,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:21,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:21,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:21,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,732 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-19 14:47:21,733 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-19 14:47:21,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:21,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:21,760 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:21,764 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-19 14:47:21,764 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:21,765 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:21,765 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:21,765 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:21,765 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:21,765 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,765 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:21,765 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:21,765 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-19 14:47:21,765 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:21,765 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:21,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:21,795 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:21,795 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:21,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,797 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-19 14:47:21,798 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-19 14:47:21,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:47:21,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:21,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:21,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:21,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:21,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:21,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:21,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:21,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:21,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:21,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:21,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:21,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:21,818 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-19 14:47:21,821 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-19 14:47:21,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:21,821 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:21,821 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:21,821 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:21,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-19 14:47:21,832 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:21,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:21,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:21,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:22,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:47:22,326 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:22,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:22,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 290 states and 314 transitions. Complement of second has 7 states. [2024-11-19 14:47:22,345 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-19 14:47:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-19 14:47:22,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-19 14:47:22,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:22,346 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:47:22,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:22,389 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-19 14:47:22,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:47:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:22,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:22,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:47:22,564 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:22,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:22,576 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 290 states and 314 transitions. Complement of second has 7 states. [2024-11-19 14:47:22,576 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-19 14:47:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-19 14:47:22,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-19 14:47:22,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:22,576 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:47:22,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:22,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:22,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:22,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:47:22,733 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:22,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:22,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 212 states and 230 transitions. Complement of second has 6 states. [2024-11-19 14:47:22,747 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-19 14:47:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-19 14:47:22,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-19 14:47:22,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:22,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 111 letters. Loop has 15 letters. [2024-11-19 14:47:22,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:22,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 30 letters. [2024-11-19 14:47:22,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:22,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 230 transitions. [2024-11-19 14:47:22,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:47:22,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 0 states and 0 transitions. [2024-11-19 14:47:22,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:47:22,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:47:22,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:47:22,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:22,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:47:22,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:47:22,749 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:47:22,749 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:47:22,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:47:22,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:47:22,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:47:22,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:47:22 BoogieIcfgContainer [2024-11-19 14:47:22,755 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:47:22,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:47:22,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:47:22,756 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:47:22,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:17" (3/4) ... [2024-11-19 14:47:22,758 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:47:22,759 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:47:22,759 INFO L158 Benchmark]: Toolchain (without parser) took 6143.19ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 130.6MB in the beginning and 165.1MB in the end (delta: -34.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-19 14:47:22,759 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:47:22,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.29ms. Allocated memory is still 201.3MB. Free memory was 130.4MB in the beginning and 169.6MB in the end (delta: -39.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-19 14:47:22,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.94ms. Allocated memory is still 201.3MB. Free memory was 169.6MB in the beginning and 168.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:47:22,760 INFO L158 Benchmark]: Boogie Preprocessor took 29.16ms. Allocated memory is still 201.3MB. Free memory was 168.6MB in the beginning and 166.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:47:22,760 INFO L158 Benchmark]: RCFGBuilder took 202.90ms. Allocated memory is still 201.3MB. Free memory was 166.4MB in the beginning and 156.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 14:47:22,760 INFO L158 Benchmark]: BuchiAutomizer took 5661.52ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 156.0MB in the beginning and 166.1MB in the end (delta: -10.2MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-11-19 14:47:22,760 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 253.8MB. Free memory was 166.1MB in the beginning and 165.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:47:22,761 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.16ms. Allocated memory is still 201.3MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.29ms. Allocated memory is still 201.3MB. Free memory was 130.4MB in the beginning and 169.6MB in the end (delta: -39.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.94ms. Allocated memory is still 201.3MB. Free memory was 169.6MB in the beginning and 168.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.16ms. Allocated memory is still 201.3MB. Free memory was 168.6MB in the beginning and 166.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 202.90ms. Allocated memory is still 201.3MB. Free memory was 166.4MB in the beginning and 156.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5661.52ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 156.0MB in the beginning and 166.1MB in the end (delta: -10.2MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 253.8MB. Free memory was 166.1MB in the beginning and 165.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 11 iterations. TraceHistogramMax:36. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 230 StatesRemovedByMinimization, 7 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1599/1599 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 123 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:47:22,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 14:47:22,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:23,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:23,388 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 Result: TRUE