./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:46:46,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:46:46,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:46:46,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:46:46,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:46:46,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:46:46,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:46:46,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:46:46,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:46:46,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:46:46,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:46:46,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:46:46,427 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:46:46,427 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:46:46,428 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:46:46,428 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:46:46,428 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:46:46,428 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:46:46,429 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:46:46,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:46:46,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:46:46,430 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:46:46,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:46:46,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:46:46,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:46:46,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:46:46,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:46:46,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:46:46,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:46:46,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:46:46,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:46:46,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:46:46,433 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:46:46,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:46:46,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:46:46,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:46:46,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:46:46,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:46:46,435 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:46:46,435 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-clean/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-clean/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-10-12 00:46:46,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:46:46,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:46:46,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:46:46,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:46:46,729 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:46:46,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-10-12 00:46:48,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:46:48,388 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:46:48,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-10-12 00:46:48,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9885bfe13/823cee9589504eb0abbef7addcecfdf6/FLAGbfdf6db66 [2024-10-12 00:46:48,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9885bfe13/823cee9589504eb0abbef7addcecfdf6 [2024-10-12 00:46:48,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:46:48,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:46:48,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:46:48,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:46:48,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:46:48,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd78e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48, skipping insertion in model container [2024-10-12 00:46:48,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:46:48,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:46:48,656 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:46:48,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:46:48,691 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:46:48,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48 WrapperNode [2024-10-12 00:46:48,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:46:48,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:46:48,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:46:48,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:46:48,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,723 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-10-12 00:46:48,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:46:48,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:46:48,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:46:48,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:46:48,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,751 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-10-12 00:46:48,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:46:48,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:46:48,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:46:48,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:46:48,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (1/1) ... [2024-10-12 00:46:48,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:46:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:46:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:46:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:46:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:46:48,946 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:46:48,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:46:49,027 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-12 00:46:49,028 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:46:49,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:46:49,038 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:46:49,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:49 BoogieIcfgContainer [2024-10-12 00:46:49,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:46:49,040 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:46:49,040 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:46:49,044 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:46:49,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:49,045 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:46:48" (1/3) ... [2024-10-12 00:46:49,046 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15714bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:46:49, skipping insertion in model container [2024-10-12 00:46:49,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:49,046 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:48" (2/3) ... [2024-10-12 00:46:49,047 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15714bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:46:49, skipping insertion in model container [2024-10-12 00:46:49,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:49,047 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:49" (3/3) ... [2024-10-12 00:46:49,050 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c [2024-10-12 00:46:49,096 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:46:49,096 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:46:49,096 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:46:49,096 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:46:49,097 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:46:49,097 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:46:49,097 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:46:49,097 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:46:49,101 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-10-12 00:46:49,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:46:49,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:49,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:49,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:49,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:46:49,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:46:49,121 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-10-12 00:46:49,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:46:49,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:49,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:49,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:49,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:46:49,129 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-10-12 00:46:49,129 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-10-12 00:46:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:46:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188779506] [2024-10-12 00:46:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:49,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash 39933, now seen corresponding path program 1 times [2024-10-12 00:46:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138398963] [2024-10-12 00:46:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:49,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138398963] [2024-10-12 00:46:49,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138398963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:46:49,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:46:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:46:49,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700161596] [2024-10-12 00:46:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:46:49,342 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:49,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:46:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:46:49,374 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-10-12 00:46:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:49,397 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-12 00:46:49,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-10-12 00:46:49,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-12 00:46:49,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 15 transitions. [2024-10-12 00:46:49,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:46:49,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:46:49,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-10-12 00:46:49,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:49,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:46:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-10-12 00:46:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2024-10-12 00:46:49,432 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-10-12 00:46:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-10-12 00:46:49,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-10-12 00:46:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:46:49,439 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-10-12 00:46:49,441 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:46:49,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-10-12 00:46:49,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 00:46:49,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:49,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:49,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:49,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:46:49,444 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-10-12 00:46:49,444 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-10-12 00:46:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:46:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988955058] [2024-10-12 00:46:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1191164837, now seen corresponding path program 1 times [2024-10-12 00:46:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165870828] [2024-10-12 00:46:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165870828] [2024-10-12 00:46:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165870828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:46:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:46:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:46:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293725535] [2024-10-12 00:46:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:46:49,513 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:46:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:46:49,515 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-10-12 00:46:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:49,526 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2024-10-12 00:46:49,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2024-10-12 00:46:49,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:46:49,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2024-10-12 00:46:49,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-12 00:46:49,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:46:49,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-10-12 00:46:49,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:49,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-12 00:46:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-10-12 00:46:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-10-12 00:46:49,529 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-10-12 00:46:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-10-12 00:46:49,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:46:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:46:49,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:46:49,531 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:46:49,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-10-12 00:46:49,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:46:49,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:49,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:49,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:49,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:46:49,532 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-10-12 00:46:49,533 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-10-12 00:46:49,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:46:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412970822] [2024-10-12 00:46:49,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:49,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1993060441, now seen corresponding path program 1 times [2024-10-12 00:46:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387938403] [2024-10-12 00:46:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387938403] [2024-10-12 00:46:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387938403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193817765] [2024-10-12 00:46:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:49,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:49,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:46:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:49,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:46:49,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:49,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193817765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:49,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 00:46:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325092699] [2024-10-12 00:46:49,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:49,747 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:46:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:46:49,748 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-10-12 00:46:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:49,788 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-12 00:46:49,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-10-12 00:46:49,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:46:49,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2024-10-12 00:46:49,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:46:49,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:46:49,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2024-10-12 00:46:49,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:49,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-12 00:46:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2024-10-12 00:46:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-12 00:46:49,795 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-10-12 00:46:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-12 00:46:49,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-12 00:46:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:46:49,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-12 00:46:49,799 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:46:49,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-10-12 00:46:49,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:46:49,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:49,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:49,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:49,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-10-12 00:46:49,803 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-10-12 00:46:49,803 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-10-12 00:46:49,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:46:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258918264] [2024-10-12 00:46:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:49,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1917011795, now seen corresponding path program 2 times [2024-10-12 00:46:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914962820] [2024-10-12 00:46:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 00:46:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914962820] [2024-10-12 00:46:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914962820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424403830] [2024-10-12 00:46:49,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:46:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:49,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:49,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 00:46:49,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:46:49,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:46:49,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:46:49,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:50,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:50,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424403830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:50,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2024-10-12 00:46:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968211797] [2024-10-12 00:46:50,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:50,131 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 00:46:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-12 00:46:50,133 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-10-12 00:46:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:50,342 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-10-12 00:46:50,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2024-10-12 00:46:50,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-12 00:46:50,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2024-10-12 00:46:50,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-12 00:46:50,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-12 00:46:50,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2024-10-12 00:46:50,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:50,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-10-12 00:46:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2024-10-12 00:46:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2024-10-12 00:46:50,352 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-10-12 00:46:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-12 00:46:50,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-12 00:46:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 00:46:50,356 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-12 00:46:50,357 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:46:50,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2024-10-12 00:46:50,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-10-12 00:46:50,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:50,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:50,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:50,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1] [2024-10-12 00:46:50,363 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-10-12 00:46:50,364 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-10-12 00:46:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:46:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901509852] [2024-10-12 00:46:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1010871677, now seen corresponding path program 3 times [2024-10-12 00:46:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926720716] [2024-10-12 00:46:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-12 00:46:50,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926720716] [2024-10-12 00:46:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926720716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450832342] [2024-10-12 00:46:50,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:46:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:50,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:50,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 00:46:50,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-10-12 00:46:50,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:46:50,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:50,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-12 00:46:50,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-12 00:46:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450832342] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:50,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:50,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:46:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515189903] [2024-10-12 00:46:50,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:50,791 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:50,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 00:46:50,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:46:50,792 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-10-12 00:46:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:50,828 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-10-12 00:46:50,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions. [2024-10-12 00:46:50,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 00:46:50,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 102 transitions. [2024-10-12 00:46:50,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-12 00:46:50,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-10-12 00:46:50,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-10-12 00:46:50,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:50,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-10-12 00:46:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-10-12 00:46:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-12 00:46:50,839 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-10-12 00:46:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-10-12 00:46:50,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-10-12 00:46:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:46:50,842 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-10-12 00:46:50,842 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:46:50,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions. [2024-10-12 00:46:50,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 00:46:50,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:50,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:50,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:50,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-10-12 00:46:50,846 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-10-12 00:46:50,846 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-10-12 00:46:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-12 00:46:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894586446] [2024-10-12 00:46:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -655757187, now seen corresponding path program 4 times [2024-10-12 00:46:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:50,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758910746] [2024-10-12 00:46:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610245, now seen corresponding path program 1 times [2024-10-12 00:46:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303314354] [2024-10-12 00:46:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:50,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:51,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:51,897 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:51,897 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:51,898 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:51,898 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:51,898 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:51,898 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:51,898 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:51,898 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:51,898 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-10-12 00:46:51,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:51,899 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:51,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:51,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:51,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:51,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:51,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:51,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:51,992 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:51,993 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:51,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:51,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:51,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:46:52,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:52,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:52,024 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:46:52,028 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-10-12 00:46:52,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:46:52,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:52,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:52,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:46:52,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:46:52,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:52,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:52,135 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:52,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:52,142 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:52,142 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:52,142 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:52,142 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:52,142 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:52,142 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,142 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:52,142 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:52,142 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-10-12 00:46:52,142 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:52,142 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:52,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:52,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:52,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:52,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:52,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:52,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:52,206 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:52,210 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:52,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:46:52,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:46:52,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:52,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:52,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:52,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:52,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:52,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:52,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:52,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:52,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:46:52,253 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-10-12 00:46:52,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:52,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:52,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:52,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:52,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:52,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:52,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:52,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:52,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:52,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:46:52,284 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-10-12 00:46:52,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:52,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:52,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:52,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:52,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:52,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:52,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:52,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:52,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:46:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:46:52,315 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-10-12 00:46:52,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:52,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:52,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:52,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:52,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:52,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:52,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:52,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:52,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:46:52,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,349 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:46:52,351 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-10-12 00:46:52,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:52,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:52,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:52,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:52,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:52,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:52,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:52,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:52,375 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:52,375 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:52,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:52,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:46:52,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:52,382 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:52,383 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:52,384 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-10-12 00:46:52,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:52,401 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:52,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:52,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:52,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:52,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:52,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:52,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:46:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-12 00:46:52,968 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-10-12 00:46:52,970 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-10-12 00:46:53,008 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-10-12 00:46:53,009 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-10-12 00:46:53,010 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-10-12 00:46:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-12 00:46:53,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 93 letters. [2024-10-12 00:46:53,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 95 letters. Loop has 93 letters. [2024-10-12 00:46:53,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 186 letters. [2024-10-12 00:46:53,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 203 transitions. [2024-10-12 00:46:53,023 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2024-10-12 00:46:53,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 187 states and 202 transitions. [2024-10-12 00:46:53,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-10-12 00:46:53,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-10-12 00:46:53,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 202 transitions. [2024-10-12 00:46:53,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:53,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 202 transitions. [2024-10-12 00:46:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 202 transitions. [2024-10-12 00:46:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-10-12 00:46:53,034 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-10-12 00:46:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-10-12 00:46:53,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-10-12 00:46:53,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-10-12 00:46:53,039 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:46:53,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions. [2024-10-12 00:46:53,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:46:53,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:53,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:53,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:46:53,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-10-12 00:46:53,041 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-10-12 00:46:53,041 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-10-12 00:46:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-10-12 00:46:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659715871] [2024-10-12 00:46:53,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 1 times [2024-10-12 00:46:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895661091] [2024-10-12 00:46:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 855328031, now seen corresponding path program 1 times [2024-10-12 00:46:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742996421] [2024-10-12 00:46:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,162 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:53,163 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:53,163 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:53,163 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:53,163 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:53,163 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,163 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:53,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:53,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-10-12 00:46:53,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:53,163 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:53,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,201 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:53,202 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:53,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,205 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:46:53,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:53,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:53,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:46:53,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,266 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:46:53,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:53,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:53,307 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:53,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:46:53,313 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:53,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:53,313 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:53,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:53,313 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:53,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:53,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:53,313 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-10-12 00:46:53,313 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:53,313 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:53,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,350 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:53,350 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:53,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,354 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:46:53,357 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-10-12 00:46:53,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:53,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:53,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:53,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:53,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:53,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:53,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:53,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:53,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:53,374 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:53,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,377 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:46:53,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:53,378 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:53,379 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:53,379 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-10-12 00:46:53,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:53,394 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:53,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:53,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:53,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:53,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:53,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:46:53,490 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-10-12 00:46:53,490 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-10-12 00:46:53,519 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-10-12 00:46:53,521 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-10-12 00:46:53,522 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-10-12 00:46:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-12 00:46:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 15 letters. [2024-10-12 00:46:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 18 letters. Loop has 15 letters. [2024-10-12 00:46:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 30 letters. [2024-10-12 00:46:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 348 transitions. [2024-10-12 00:46:53,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:46:53,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 233 states and 254 transitions. [2024-10-12 00:46:53,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:46:53,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-12 00:46:53,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 254 transitions. [2024-10-12 00:46:53,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:53,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 254 transitions. [2024-10-12 00:46:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 254 transitions. [2024-10-12 00:46:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2024-10-12 00:46:53,541 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-10-12 00:46:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-10-12 00:46:53,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-10-12 00:46:53,543 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-10-12 00:46:53,543 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:46:53,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 142 transitions. [2024-10-12 00:46:53,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:46:53,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:53,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:53,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:46:53,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:46:53,544 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-10-12 00:46:53,544 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-10-12 00:46:53,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-10-12 00:46:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206490956] [2024-10-12 00:46:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times [2024-10-12 00:46:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381028944] [2024-10-12 00:46:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 889666765, now seen corresponding path program 1 times [2024-10-12 00:46:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549965102] [2024-10-12 00:46:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,579 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:53,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:53,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:53,580 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:53,580 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:53,580 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,580 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:53,580 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:53,580 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-10-12 00:46:53,580 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:53,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:53,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:53,603 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,605 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:46:53,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:53,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:53,624 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:46:53,624 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-10-12 00:46:53,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:53,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,642 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:46:53,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:53,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:53,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:53,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,675 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:46:53,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:53,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:53,717 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:53,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:46:53,723 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:53,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:53,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:53,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:53,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:53,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:53,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:53,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-10-12 00:46:53,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:53,723 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:53,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,747 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:53,748 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,749 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:46:53,752 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-10-12 00:46:53,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:53,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:53,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:53,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:53,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:53,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:53,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:53,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:53,772 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:53,772 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:53,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,774 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:46:53,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:53,776 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:53,777 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:53,777 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-10-12 00:46:53,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:46:53,792 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:53,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:53,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:53,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:53,821 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:53,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:53,834 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-10-12 00:46:53,834 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-10-12 00:46:53,859 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-10-12 00:46:53,862 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-10-12 00:46:53,863 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-10-12 00:46:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-12 00:46:53,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:46:53,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:46:53,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:46:53,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:53,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 199 transitions. [2024-10-12 00:46:53,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:46:53,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 160 states and 175 transitions. [2024-10-12 00:46:53,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:46:53,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:46:53,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 175 transitions. [2024-10-12 00:46:53,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:53,869 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 175 transitions. [2024-10-12 00:46:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 175 transitions. [2024-10-12 00:46:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2024-10-12 00:46:53,877 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-10-12 00:46:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-10-12 00:46:53,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-10-12 00:46:53,878 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-10-12 00:46:53,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:46:53,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2024-10-12 00:46:53,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:46:53,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:53,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:53,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1] [2024-10-12 00:46:53,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:46:53,881 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-10-12 00:46:53,881 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-10-12 00:46:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash 745365203, now seen corresponding path program 2 times [2024-10-12 00:46:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344313511] [2024-10-12 00:46:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times [2024-10-12 00:46:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110295297] [2024-10-12 00:46:53,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -963577515, now seen corresponding path program 3 times [2024-10-12 00:46:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253698222] [2024-10-12 00:46:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:53,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:53,946 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:53,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:53,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:53,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:53,947 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:53,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:53,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:53,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-10-12 00:46:53,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:53,947 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:53,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:53,969 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:53,970 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:53,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:53,972 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:46:53,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:53,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:53,990 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:46:53,990 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-10-12 00:46:54,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:46:54,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,008 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:46:54,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:54,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:54,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:54,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,043 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:46:54,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:54,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:54,086 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:54,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-12 00:46:54,091 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:54,091 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:54,091 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:54,091 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:54,091 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:54,091 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,091 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:54,092 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:54,092 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-10-12 00:46:54,092 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:54,092 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:54,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:54,120 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,123 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:46:54,125 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-10-12 00:46:54,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:54,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:54,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:54,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:54,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:54,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:54,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:54,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:54,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:54,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,182 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:54,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:46:54,189 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-10-12 00:46:54,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:46:54,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:54,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:54,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:54,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:54,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:54,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:54,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:54,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:54,215 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:54,215 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:54,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,217 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:46:54,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:54,220 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:54,220 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:54,220 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-10-12 00:46:54,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:54,235 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:54,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,286 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:54,297 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-10-12 00:46:54,297 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-10-12 00:46:54,318 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-10-12 00:46:54,319 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-10-12 00:46:54,320 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-10-12 00:46:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-12 00:46:54,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-10-12 00:46:54,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:54,320 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:54,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,362 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:54,374 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-10-12 00:46:54,375 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-10-12 00:46:54,391 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-10-12 00:46:54,391 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-10-12 00:46:54,392 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-10-12 00:46:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-12 00:46:54,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-10-12 00:46:54,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:54,392 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,443 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:54,455 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-10-12 00:46:54,455 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-10-12 00:46:54,477 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-10-12 00:46:54,479 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-10-12 00:46:54,479 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-10-12 00:46:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-12 00:46:54,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2024-10-12 00:46:54,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:54,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 2 letters. [2024-10-12 00:46:54,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:54,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 4 letters. [2024-10-12 00:46:54,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:54,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 221 transitions. [2024-10-12 00:46:54,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:46:54,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 112 states and 121 transitions. [2024-10-12 00:46:54,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-12 00:46:54,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:46:54,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2024-10-12 00:46:54,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:54,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-10-12 00:46:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2024-10-12 00:46:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-12 00:46:54,493 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-10-12 00:46:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-10-12 00:46:54,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-10-12 00:46:54,494 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-10-12 00:46:54,494 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:46:54,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 120 transitions. [2024-10-12 00:46:54,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:46:54,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:54,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:54,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-10-12 00:46:54,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-10-12 00:46:54,504 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-10-12 00:46:54,504 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-10-12 00:46:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1672375441, now seen corresponding path program 2 times [2024-10-12 00:46:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286416292] [2024-10-12 00:46:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:54,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:54,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:54,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 2 times [2024-10-12 00:46:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817477880] [2024-10-12 00:46:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:54,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:54,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:54,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350057, now seen corresponding path program 3 times [2024-10-12 00:46:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:54,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735497920] [2024-10-12 00:46:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:54,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:54,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:54,656 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:54,656 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:54,656 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:54,656 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:54,656 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:54,656 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,656 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:54,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:54,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-10-12 00:46:54,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:54,656 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:54,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:54,694 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:54,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,696 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:46:54,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:54,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:54,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:54,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,722 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:46:54,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:54,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:54,762 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:54,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:46:54,767 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:54,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:54,768 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:54,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:54,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:54,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:54,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:54,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-10-12 00:46:54,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:54,768 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:54,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:54,804 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:54,804 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:54,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,806 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,809 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-10-12 00:46:54,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:46:54,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:54,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:54,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:54,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:54,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:54,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:54,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:54,827 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:54,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:54,830 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:54,832 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:54,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:46:54,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:54,834 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:54,834 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:54,834 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-10-12 00:46:54,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:54,849 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:54,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:54,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:54,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:55,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:55,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:46:55,072 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-10-12 00:46:55,072 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-10-12 00:46:55,092 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-10-12 00:46:55,093 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-10-12 00:46:55,093 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-10-12 00:46:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-12 00:46:55,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-10-12 00:46:55,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:55,094 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:55,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:55,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:55,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:55,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:55,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:46:55,306 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-10-12 00:46:55,307 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-10-12 00:46:55,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:55,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:46:55,371 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-10-12 00:46:55,372 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-10-12 00:46:55,372 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-10-12 00:46:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-12 00:46:55,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-10-12 00:46:55,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:55,373 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:55,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:55,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:55,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:55,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:55,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:46:55,597 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-10-12 00:46:55,597 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-10-12 00:46:55,615 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-10-12 00:46:55,616 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-10-12 00:46:55,616 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-10-12 00:46:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-12 00:46:55,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 15 letters. [2024-10-12 00:46:55,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:55,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 111 letters. Loop has 15 letters. [2024-10-12 00:46:55,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:55,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 30 letters. [2024-10-12 00:46:55,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:55,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 230 transitions. [2024-10-12 00:46:55,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:55,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 0 states and 0 transitions. [2024-10-12 00:46:55,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:46:55,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:46:55,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:46:55,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:55,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:55,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:55,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:55,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:46:55,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:46:55,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:55,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:46:55,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:46:55 BoogieIcfgContainer [2024-10-12 00:46:55,628 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:46:55,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:46:55,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:46:55,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:46:55,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:49" (3/4) ... [2024-10-12 00:46:55,631 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:46:55,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:46:55,633 INFO L158 Benchmark]: Toolchain (without parser) took 7209.79ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 90.7MB in the beginning and 180.7MB in the end (delta: -90.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:55,633 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:55,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.07ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 78.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:46:55,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.31ms. Allocated memory is still 161.5MB. Free memory was 78.8MB in the beginning and 77.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:55,634 INFO L158 Benchmark]: Boogie Preprocessor took 42.37ms. Allocated memory is still 161.5MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:55,634 INFO L158 Benchmark]: RCFGBuilder took 271.61ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 127.6MB in the end (delta: -51.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-12 00:46:55,634 INFO L158 Benchmark]: BuchiAutomizer took 6588.57ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 127.4MB in the beginning and 180.7MB in the end (delta: -53.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-10-12 00:46:55,634 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 243.3MB. Free memory is still 180.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:55,636 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 161.5MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.07ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 78.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.31ms. Allocated memory is still 161.5MB. Free memory was 78.8MB in the beginning and 77.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.37ms. Allocated memory is still 161.5MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 271.61ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 127.6MB in the end (delta: -51.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 6588.57ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 127.4MB in the beginning and 180.7MB in the end (delta: -53.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 243.3MB. Free memory is still 180.7MB. 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 6.5s and 11 iterations. TraceHistogramMax:36. Analysis of lassos took 4.1s. 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: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:46:55,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:55,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:56,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:56,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE