./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:57:25,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:57:25,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:57:25,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:57:25,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:57:25,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:57:25,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:57:25,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:57:25,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:57:25,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:57:25,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:57:25,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:57:25,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:57:25,877 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:57:25,878 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:57:25,878 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:57:25,878 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:57:25,878 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:57:25,879 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:57:25,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:57:25,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:57:25,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:57:25,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:57:25,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:57:25,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:57:25,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:57:25,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:57:25,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:57:25,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:57:25,886 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:57:25,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:57:25,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:57:25,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:57:25,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:57:25,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:57:25,888 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:57:25,889 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2024-10-13 16:57:26,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:57:26,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:57:26,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:57:26,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:57:26,180 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:57:26,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2024-10-13 16:57:27,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:57:27,898 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:57:27,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2024-10-13 16:57:27,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10765664f/4b79cb9511ff4ce085f802ac26cf61da/FLAGf5fe18e66 [2024-10-13 16:57:27,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10765664f/4b79cb9511ff4ce085f802ac26cf61da [2024-10-13 16:57:27,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:57:27,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:57:27,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:27,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:57:27,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:57:27,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:27" (1/1) ... [2024-10-13 16:57:27,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319896b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:27, skipping insertion in model container [2024-10-13 16:57:27,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:27" (1/1) ... [2024-10-13 16:57:27,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:57:28,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:28,111 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:57:28,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:28,142 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:57:28,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28 WrapperNode [2024-10-13 16:57:28,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:28,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:28,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:57:28,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:57:28,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,170 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-10-13 16:57:28,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:28,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:57:28,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:57:28,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:57:28,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,190 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:57:28,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:57:28,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:57:28,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:57:28,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:57:28,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (1/1) ... [2024-10-13 16:57:28,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:28,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:28,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 16:57:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2024-10-13 16:57:28,293 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2024-10-13 16:57:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:57:28,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:57:28,346 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:57:28,348 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:57:28,477 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 16:57:28,477 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:57:28,489 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:57:28,490 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 16:57:28,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:28 BoogieIcfgContainer [2024-10-13 16:57:28,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:57:28,495 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:57:28,495 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:57:28,499 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:57:28,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:28,500 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:57:27" (1/3) ... [2024-10-13 16:57:28,501 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a3756c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:28, skipping insertion in model container [2024-10-13 16:57:28,501 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:28,501 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:28" (2/3) ... [2024-10-13 16:57:28,502 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a3756c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:28, skipping insertion in model container [2024-10-13 16:57:28,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:28,502 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:28" (3/3) ... [2024-10-13 16:57:28,504 INFO L332 chiAutomizerObserver]: Analyzing ICFG Parts.c [2024-10-13 16:57:28,560 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:57:28,560 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:57:28,561 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:57:28,561 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:57:28,561 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:57:28,561 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:57:28,562 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:57:28,562 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:57:28,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:57:28,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:57:28,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:28,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:28,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:28,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:28,595 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:57:28,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:57:28,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:57:28,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:28,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:28,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:28,598 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:28,606 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 23#L28true assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5#L31true assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 16#L34-3true [2024-10-13 16:57:28,606 INFO L747 eck$LassoCheckResult]: Loop: 16#L34-3true assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 12#L35-2true assume !true; 8#L35-3true havoc main_~q~0#1; 7#L34-2true main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16#L34-3true [2024-10-13 16:57:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2024-10-13 16:57:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607868982] [2024-10-13 16:57:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2137072, now seen corresponding path program 1 times [2024-10-13 16:57:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405369523] [2024-10-13 16:57:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:28,784 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-13 16:57:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:28,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405369523] [2024-10-13 16:57:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405369523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:28,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:57:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477474974] [2024-10-13 16:57:28,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:28,792 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 16:57:28,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 16:57:28,831 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:28,843 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2024-10-13 16:57:28,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2024-10-13 16:57:28,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:57:28,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 28 transitions. [2024-10-13 16:57:28,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-13 16:57:28,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-13 16:57:28,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2024-10-13 16:57:28,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:57:28,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-13 16:57:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2024-10-13 16:57:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-13 16:57:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:57:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-13 16:57:28,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-13 16:57:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 16:57:28,900 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-13 16:57:28,902 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:57:28,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2024-10-13 16:57:28,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:57:28,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:28,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:28,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:28,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:28,906 INFO L745 eck$LassoCheckResult]: Stem: 77#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 70#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 67#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 68#L34-3 [2024-10-13 16:57:28,906 INFO L747 eck$LassoCheckResult]: Loop: 68#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 78#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 72#L35-3 havoc main_~q~0#1; 71#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 68#L34-3 [2024-10-13 16:57:28,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2024-10-13 16:57:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604384747] [2024-10-13 16:57:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2130345, now seen corresponding path program 1 times [2024-10-13 16:57:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804159013] [2024-10-13 16:57:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -821894448, now seen corresponding path program 1 times [2024-10-13 16:57:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909698427] [2024-10-13 16:57:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,045 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-13 16:57:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909698427] [2024-10-13 16:57:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909698427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:57:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073015016] [2024-10-13 16:57:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:29,110 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:29,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:29,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:29,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:29,111 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:29,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:29,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:29,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2024-10-13 16:57:29,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:29,112 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:29,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,196 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:29,197 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:29,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 16:57:29,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:29,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:29,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 16:57:29,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:29,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,321 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:29,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:29,327 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:29,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:29,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:29,328 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:29,328 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:29,328 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,328 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:29,328 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:29,328 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2024-10-13 16:57:29,328 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:29,328 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:29,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,385 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:29,390 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 16:57:29,396 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-13 16:57:29,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:29,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:29,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:29,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:29,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:29,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:29,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:29,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:29,430 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-13 16:57:29,430 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-13 16:57:29,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 16:57:29,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:29,478 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:29,479 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:29,480 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -1*ULTIMATE.start_main_~p~0#1 Supporting invariants [] [2024-10-13 16:57:29,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 16:57:29,507 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:29,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:29,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,580 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:29,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:29,642 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-13 16:57:29,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 16:57:29,647 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-13 16:57:29,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 31 states and 41 transitions. Complement of second has 7 states. [2024-10-13 16:57:29,711 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-13 16:57:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-13 16:57:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 16:57:29,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-13 16:57:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:29,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-13 16:57:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:29,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 8 letters. [2024-10-13 16:57:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:29,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-10-13 16:57:29,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:57:29,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 38 transitions. [2024-10-13 16:57:29,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-13 16:57:29,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 16:57:29,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2024-10-13 16:57:29,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:29,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-13 16:57:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2024-10-13 16:57:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-13 16:57:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:57:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-13 16:57:29,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-13 16:57:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:29,731 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-13 16:57:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:29,763 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-13 16:57:29,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2024-10-13 16:57:29,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-13 16:57:29,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2024-10-13 16:57:29,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-13 16:57:29,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 16:57:29,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2024-10-13 16:57:29,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:57:29,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-13 16:57:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2024-10-13 16:57:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-13 16:57:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:57:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-13 16:57:29,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-13 16:57:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:29,771 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-13 16:57:29,771 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:57:29,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-10-13 16:57:29,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-13 16:57:29,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:29,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:29,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:29,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:29,773 INFO L745 eck$LassoCheckResult]: Stem: 233#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 226#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 223#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 224#L34-3 [2024-10-13 16:57:29,773 INFO L747 eck$LassoCheckResult]: Loop: 224#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 234#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 215#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 222#$Ultimate##0 ~p := #in~p;~q := #in~q; 232#L20 assume ~p <= 0;#res := 1; 231#partsFINAL assume true; 214#partsEXIT >#71#return; 219#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 235#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 229#L35-3 havoc main_~q~0#1; 227#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 224#L34-3 [2024-10-13 16:57:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 3 times [2024-10-13 16:57:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174120422] [2024-10-13 16:57:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:29,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -601564238, now seen corresponding path program 1 times [2024-10-13 16:57:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677798797] [2024-10-13 16:57:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:29,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 273756331, now seen corresponding path program 1 times [2024-10-13 16:57:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:29,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320006281] [2024-10-13 16:57:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:29,943 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:29,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:29,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:29,943 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:29,944 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:29,944 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,944 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:29,944 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:29,944 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2024-10-13 16:57:29,944 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:29,944 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:29,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:30,000 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:30,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 16:57:30,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:30,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:30,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 16:57:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 16:57:30,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:30,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:30,064 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:30,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:30,069 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:30,069 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:30,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:30,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:30,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:30,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:30,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:30,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2024-10-13 16:57:30,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:30,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:30,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,122 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:30,122 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:30,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 16:57:30,128 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-13 16:57:30,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:30,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 16:57:30,164 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-13 16:57:30,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:30,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 16:57:30,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 16:57:30,202 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-13 16:57:30,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:30,223 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:30,223 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 16:57:30,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:30,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:30,228 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:30,228 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2024-10-13 16:57:30,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-13 16:57:30,246 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:30,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:30,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:30,389 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-13 16:57:30,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-13 16:57:30,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:30,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 159 states and 248 transitions. Complement of second has 34 states. [2024-10-13 16:57:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2024-10-13 16:57:30,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 11 letters. [2024-10-13 16:57:30,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 15 letters. Loop has 11 letters. [2024-10-13 16:57:30,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 22 letters. [2024-10-13 16:57:30,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 248 transitions. [2024-10-13 16:57:30,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-13 16:57:30,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 157 states and 246 transitions. [2024-10-13 16:57:30,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-10-13 16:57:30,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-10-13 16:57:30,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 246 transitions. [2024-10-13 16:57:30,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:30,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-10-13 16:57:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 246 transitions. [2024-10-13 16:57:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2024-10-13 16:57:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.315217391304348) internal successors, (121), 87 states have internal predecessors, (121), 28 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (48), 36 states have call predecessors, (48), 28 states have call successors, (48) [2024-10-13 16:57:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2024-10-13 16:57:30,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 197 transitions. [2024-10-13 16:57:30,715 INFO L425 stractBuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2024-10-13 16:57:30,715 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:57:30,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 197 transitions. [2024-10-13 16:57:30,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-13 16:57:30,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:30,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:30,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:30,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:30,719 INFO L745 eck$LassoCheckResult]: Stem: 550#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 529#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 526#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 527#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 560#L35-2 [2024-10-13 16:57:30,719 INFO L747 eck$LassoCheckResult]: Loop: 560#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 562#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 566#$Ultimate##0 ~p := #in~p;~q := #in~q; 584#L20 assume !(~p <= 0); 570#L21 assume ~q <= 0;#res := 0; 568#partsFINAL assume true; 565#partsEXIT >#71#return; 563#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 561#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 541#L35-3 havoc main_~q~0#1; 533#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 534#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 560#L35-2 [2024-10-13 16:57:30,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 1 times [2024-10-13 16:57:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854274977] [2024-10-13 16:57:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:30,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:30,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:30,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1796298250, now seen corresponding path program 1 times [2024-10-13 16:57:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000326178] [2024-10-13 16:57:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,960 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-13 16:57:30,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000326178] [2024-10-13 16:57:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000326178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 16:57:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233844366] [2024-10-13 16:57:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:30,961 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 16:57:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 16:57:30,962 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. cyclomatic complexity: 70 Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:31,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 16:57:31,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:31,299 INFO L93 Difference]: Finished difference Result 265 states and 484 transitions. [2024-10-13 16:57:31,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 484 transitions. [2024-10-13 16:57:31,314 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2024-10-13 16:57:31,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 256 states and 475 transitions. [2024-10-13 16:57:31,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-10-13 16:57:31,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-13 16:57:31,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 475 transitions. [2024-10-13 16:57:31,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:31,330 INFO L218 hiAutomatonCegarLoop]: Abstraction has 256 states and 475 transitions. [2024-10-13 16:57:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 475 transitions. [2024-10-13 16:57:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2024-10-13 16:57:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 40 states have call successors, (40), 12 states have call predecessors, (40), 30 states have return successors, (166), 57 states have call predecessors, (166), 40 states have call successors, (166) [2024-10-13 16:57:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 383 transitions. [2024-10-13 16:57:31,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 210 states and 383 transitions. [2024-10-13 16:57:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 16:57:31,368 INFO L425 stractBuchiCegarLoop]: Abstraction has 210 states and 383 transitions. [2024-10-13 16:57:31,368 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:57:31,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 383 transitions. [2024-10-13 16:57:31,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2024-10-13 16:57:31,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:31,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:31,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:31,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:31,373 INFO L745 eck$LassoCheckResult]: Stem: 975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 935#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 932#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 933#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 985#L35-2 [2024-10-13 16:57:31,373 INFO L747 eck$LassoCheckResult]: Loop: 985#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 919#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 993#$Ultimate##0 ~p := #in~p;~q := #in~q; 1042#L20 assume !(~p <= 0); 1039#L21 assume ~q <= 0;#res := 0; 1000#partsFINAL assume true; 997#partsEXIT >#71#return; 996#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 985#L35-2 [2024-10-13 16:57:31,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 2 times [2024-10-13 16:57:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833783639] [2024-10-13 16:57:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:31,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:31,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:31,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 499890354, now seen corresponding path program 1 times [2024-10-13 16:57:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43994614] [2024-10-13 16:57:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:31,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:31,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 188539696, now seen corresponding path program 1 times [2024-10-13 16:57:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913418366] [2024-10-13 16:57:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,459 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-13 16:57:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913418366] [2024-10-13 16:57:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913418366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:31,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:31,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:57:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074514872] [2024-10-13 16:57:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:31,551 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:31,551 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:31,551 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:31,551 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:31,552 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:31,552 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,552 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:31,552 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:31,552 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2024-10-13 16:57:31,552 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:31,552 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:31,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,589 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:31,590 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 16:57:31,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:31,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:31,611 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:31,612 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:31,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:31,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 16:57:31,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:31,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:31,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-13 16:57:31,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,648 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 16:57:31,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:31,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:31,687 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:31,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:31,692 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:31,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:31,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:31,692 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:31,692 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:31,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:31,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:31,692 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2024-10-13 16:57:31,692 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:31,692 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:31,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,730 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:31,730 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 16:57:31,734 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-13 16:57:31,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:31,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:31,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:31,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:31,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:31,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:31,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:31,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:31,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 16:57:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,765 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 16:57:31,767 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-13 16:57:31,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:31,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:31,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:31,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:31,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:31,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:31,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:31,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:31,787 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:31,787 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,789 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 16:57:31,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:31,791 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:31,791 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:31,791 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2024-10-13 16:57:31,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-13 16:57:31,807 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:31,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,913 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-13 16:57:31,915 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-13 16:57:31,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 383 transitions. cyclomatic complexity: 178 Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:32,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 383 transitions. cyclomatic complexity: 178. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 1177 states and 2382 transitions. Complement of second has 39 states. [2024-10-13 16:57:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2024-10-13 16:57:32,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-13 16:57:32,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:32,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 13 letters. Loop has 8 letters. [2024-10-13 16:57:32,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:32,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 5 letters. Loop has 16 letters. [2024-10-13 16:57:32,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:32,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 2382 transitions. [2024-10-13 16:57:32,160 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 62 [2024-10-13 16:57:32,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 1022 states and 2053 transitions. [2024-10-13 16:57:32,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-10-13 16:57:32,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2024-10-13 16:57:32,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1022 states and 2053 transitions. [2024-10-13 16:57:32,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:32,196 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1022 states and 2053 transitions. [2024-10-13 16:57:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states and 2053 transitions. [2024-10-13 16:57:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 843. [2024-10-13 16:57:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 539 states have (on average 1.2467532467532467) internal successors, (672), 536 states have internal predecessors, (672), 178 states have call successors, (178), 51 states have call predecessors, (178), 126 states have return successors, (797), 255 states have call predecessors, (797), 175 states have call successors, (797) [2024-10-13 16:57:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1647 transitions. [2024-10-13 16:57:32,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 843 states and 1647 transitions. [2024-10-13 16:57:32,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 16:57:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 16:57:32,287 INFO L87 Difference]: Start difference. First operand 843 states and 1647 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:32,359 INFO L93 Difference]: Finished difference Result 754 states and 1224 transitions. [2024-10-13 16:57:32,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1224 transitions. [2024-10-13 16:57:32,369 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-13 16:57:32,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 337 states and 528 transitions. [2024-10-13 16:57:32,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-10-13 16:57:32,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-10-13 16:57:32,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 528 transitions. [2024-10-13 16:57:32,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:32,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 528 transitions. [2024-10-13 16:57:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 528 transitions. [2024-10-13 16:57:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 315. [2024-10-13 16:57:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 212 states have internal predecessors, (253), 72 states have call successors, (72), 29 states have call predecessors, (72), 38 states have return successors, (175), 73 states have call predecessors, (175), 64 states have call successors, (175) [2024-10-13 16:57:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 500 transitions. [2024-10-13 16:57:32,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 500 transitions. [2024-10-13 16:57:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:57:32,385 INFO L425 stractBuchiCegarLoop]: Abstraction has 315 states and 500 transitions. [2024-10-13 16:57:32,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 16:57:32,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 500 transitions. [2024-10-13 16:57:32,388 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-13 16:57:32,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:32,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:32,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:32,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:32,389 INFO L745 eck$LassoCheckResult]: Stem: 4066#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4034#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4035#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4032#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 4033#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 4067#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 4022#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4257#$Ultimate##0 ~p := #in~p;~q := #in~q; 4255#L20 assume ~p <= 0;#res := 1; 4253#partsFINAL assume true; 4254#partsEXIT >#71#return; 4073#L36-1 [2024-10-13 16:57:32,389 INFO L747 eck$LassoCheckResult]: Loop: 4073#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4074#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 4036#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4037#$Ultimate##0 ~p := #in~p;~q := #in~q; 4301#L20 assume ~p <= 0;#res := 1; 4302#partsFINAL assume true; 4220#partsEXIT >#71#return; 4073#L36-1 [2024-10-13 16:57:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 621423982, now seen corresponding path program 1 times [2024-10-13 16:57:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347147600] [2024-10-13 16:57:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:32,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:32,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 283574208, now seen corresponding path program 1 times [2024-10-13 16:57:32,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:32,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123703402] [2024-10-13 16:57:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:32,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:32,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:32,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -597668429, now seen corresponding path program 1 times [2024-10-13 16:57:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791034422] [2024-10-13 16:57:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:32,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:32,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:32,496 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:32,496 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:32,496 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:32,497 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:32,497 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:32,497 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,497 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:32,497 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:32,497 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2024-10-13 16:57:32,497 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:32,497 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:32,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:32,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:32,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:32,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:32,525 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,526 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 16:57:32,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:32,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:32,543 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:32,543 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:32,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-13 16:57:32,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,560 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 16:57:32,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:32,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:32,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 16:57:32,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,597 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 16:57:32,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:32,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:32,812 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:32,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:32,817 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:32,817 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:32,817 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:32,817 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:32,817 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:32,817 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,817 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:32,817 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:32,817 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2024-10-13 16:57:32,817 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:32,817 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:32,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:32,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:32,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:32,848 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:32,848 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:32,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,850 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 16:57:32,853 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-13 16:57:32,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:32,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:32,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:32,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:32,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:32,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:32,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:32,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:32,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-13 16:57:32,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,886 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 16:57:32,889 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-13 16:57:32,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:32,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:32,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:32,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:32,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:32,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:32,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:32,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:32,916 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:32,916 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:32,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,919 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 16:57:32,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:32,921 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:32,921 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:32,922 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2024-10-13 16:57:32,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 16:57:32,938 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:32,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:32,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:33,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:33,060 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-13 16:57:33,061 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:33,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 500 transitions. cyclomatic complexity: 193 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:57:33,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:33,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-13 16:57:33,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 500 transitions. cyclomatic complexity: 193. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 492 states and 789 transitions. Complement of second has 13 states. [2024-10-13 16:57:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:57:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2024-10-13 16:57:33,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2024-10-13 16:57:33,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:33,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2024-10-13 16:57:33,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:33,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2024-10-13 16:57:33,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:33,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 789 transitions. [2024-10-13 16:57:33,215 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2024-10-13 16:57:33,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 390 states and 617 transitions. [2024-10-13 16:57:33,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 262 [2024-10-13 16:57:33,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2024-10-13 16:57:33,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 390 states and 617 transitions. [2024-10-13 16:57:33,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:33,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 390 states and 617 transitions. [2024-10-13 16:57:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states and 617 transitions. [2024-10-13 16:57:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2024-10-13 16:57:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 251 states have (on average 1.2151394422310757) internal successors, (305), 258 states have internal predecessors, (305), 90 states have call successors, (92), 37 states have call predecessors, (92), 47 states have return successors, (218), 92 states have call predecessors, (218), 78 states have call successors, (218) [2024-10-13 16:57:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 615 transitions. [2024-10-13 16:57:33,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 388 states and 615 transitions. [2024-10-13 16:57:33,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 388 states and 615 transitions. [2024-10-13 16:57:33,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 16:57:33,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 388 states and 615 transitions. [2024-10-13 16:57:33,239 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2024-10-13 16:57:33,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:33,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:33,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:33,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:33,240 INFO L745 eck$LassoCheckResult]: Stem: 4994#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4941#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4942#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4939#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 4940#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 4995#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 4943#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4944#$Ultimate##0 ~p := #in~p;~q := #in~q; 5184#L20 assume !(~p <= 0); 5185#L21 assume !(~q <= 0); 5252#L22 assume ~q > ~p; 5188#L22-1 call #t~ret0 := parts(~p, ~p);< 5246#$Ultimate##0 [2024-10-13 16:57:33,240 INFO L747 eck$LassoCheckResult]: Loop: 5246#$Ultimate##0 ~p := #in~p;~q := #in~q; 5251#L20 assume !(~p <= 0); 5250#L21 assume !(~q <= 0); 5248#L22 assume ~q > ~p; 5189#L22-1 call #t~ret0 := parts(~p, ~p);< 5246#$Ultimate##0 [2024-10-13 16:57:33,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2084292643, now seen corresponding path program 1 times [2024-10-13 16:57:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229702720] [2024-10-13 16:57:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,283 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-13 16:57:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229702720] [2024-10-13 16:57:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229702720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:57:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146410572] [2024-10-13 16:57:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:33,284 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:33,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 28756408, now seen corresponding path program 1 times [2024-10-13 16:57:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999209770] [2024-10-13 16:57:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:33,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:33,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:33,355 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:33,355 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:33,355 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:33,355 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:33,355 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:33,355 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,355 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:33,356 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:33,356 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2024-10-13 16:57:33,356 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:33,356 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:33,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,419 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:33,419 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:33,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,422 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 16:57:33,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:33,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:33,438 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:33,439 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:33,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-13 16:57:33,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,454 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 16:57:33,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:33,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:33,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-13 16:57:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,498 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 16:57:33,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:33,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:33,671 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:33,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:33,677 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:33,677 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:33,677 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:33,677 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:33,677 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:33,677 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,678 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:33,678 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:33,678 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2024-10-13 16:57:33,678 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:33,678 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:33,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:33,736 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:33,736 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:33,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,740 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 16:57:33,741 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-13 16:57:33,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:33,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:33,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:33,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:33,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:33,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:33,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:33,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:33,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:33,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,772 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 16:57:33,776 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-13 16:57:33,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:33,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:33,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:33,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:33,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:33,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:33,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:33,794 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:33,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:33,798 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:33,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,800 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 16:57:33,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:33,802 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:33,802 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:33,802 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-10-13 16:57:33,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:33,818 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:33,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:33,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:33,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:33,930 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-13 16:57:33,931 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-13 16:57:33,931 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 388 states and 615 transitions. cyclomatic complexity: 236 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:34,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 388 states and 615 transitions. cyclomatic complexity: 236. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1110 states and 2143 transitions. Complement of second has 45 states. [2024-10-13 16:57:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2024-10-13 16:57:34,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2024-10-13 16:57:34,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:34,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2024-10-13 16:57:34,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:34,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2024-10-13 16:57:34,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:34,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1110 states and 2143 transitions. [2024-10-13 16:57:34,061 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 232 [2024-10-13 16:57:34,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1110 states to 1049 states and 2041 transitions. [2024-10-13 16:57:34,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2024-10-13 16:57:34,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 595 [2024-10-13 16:57:34,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1049 states and 2041 transitions. [2024-10-13 16:57:34,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:34,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1049 states and 2041 transitions. [2024-10-13 16:57:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states and 2041 transitions. [2024-10-13 16:57:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 952. [2024-10-13 16:57:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 603 states have (on average 1.2404643449419568) internal successors, (748), 645 states have internal predecessors, (748), 246 states have call successors, (248), 101 states have call predecessors, (248), 103 states have return successors, (765), 205 states have call predecessors, (765), 217 states have call successors, (765) [2024-10-13 16:57:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1761 transitions. [2024-10-13 16:57:34,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 952 states and 1761 transitions. [2024-10-13 16:57:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 16:57:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 16:57:34,134 INFO L87 Difference]: Start difference. First operand 952 states and 1761 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:34,180 INFO L93 Difference]: Finished difference Result 825 states and 1466 transitions. [2024-10-13 16:57:34,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1466 transitions. [2024-10-13 16:57:34,196 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 149 [2024-10-13 16:57:34,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 824 states and 1465 transitions. [2024-10-13 16:57:34,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2024-10-13 16:57:34,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2024-10-13 16:57:34,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 824 states and 1465 transitions. [2024-10-13 16:57:34,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:34,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 824 states and 1465 transitions. [2024-10-13 16:57:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states and 1465 transitions. [2024-10-13 16:57:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 816. [2024-10-13 16:57:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 526 states have (on average 1.2376425855513309) internal successors, (651), 566 states have internal predecessors, (651), 197 states have call successors, (199), 86 states have call predecessors, (199), 93 states have return successors, (607), 163 states have call predecessors, (607), 177 states have call successors, (607) [2024-10-13 16:57:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1457 transitions. [2024-10-13 16:57:34,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 816 states and 1457 transitions. [2024-10-13 16:57:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 16:57:34,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 816 states and 1457 transitions. [2024-10-13 16:57:34,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 16:57:34,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 816 states and 1457 transitions. [2024-10-13 16:57:34,246 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 147 [2024-10-13 16:57:34,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:34,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:34,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:34,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:34,248 INFO L745 eck$LassoCheckResult]: Stem: 8377#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 8335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 8336#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8333#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 8334#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 8400#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 8401#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 8922#$Ultimate##0 ~p := #in~p;~q := #in~q; 8938#L20 assume ~p <= 0;#res := 1; 8930#partsFINAL assume true; 8920#partsEXIT >#71#return; 8921#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 8632#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 8630#L35-3 havoc main_~q~0#1; 8629#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 8627#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 8603#L35-2 [2024-10-13 16:57:34,248 INFO L747 eck$LassoCheckResult]: Loop: 8603#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 8599#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 8600#$Ultimate##0 ~p := #in~p;~q := #in~q; 8610#L20 assume !(~p <= 0); 8611#L21 assume ~q <= 0;#res := 0; 8665#partsFINAL assume true; 8662#partsEXIT >#71#return; 8468#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 8420#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 8413#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 8558#$Ultimate##0 ~p := #in~p;~q := #in~q; 8551#L20 assume !(~p <= 0); 8546#L21 assume !(~q <= 0); 8545#L22 assume !(~q > ~p); 8458#L23 call #t~ret1 := parts(~p - ~q, ~q);< 8569#$Ultimate##0 ~p := #in~p;~q := #in~q; 8594#L20 assume ~p <= 0;#res := 1; 8570#partsFINAL assume true; 8568#partsEXIT >#67#return; 8448#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 8494#$Ultimate##0 ~p := #in~p;~q := #in~q; 8560#L20 assume !(~p <= 0); 8554#L21 assume ~q <= 0;#res := 0; 8555#partsFINAL assume true; 8623#partsEXIT >#69#return; 8474#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 8567#partsFINAL assume true; 8566#partsEXIT >#71#return; 8565#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 8411#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 8412#L35-3 havoc main_~q~0#1; 8628#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 8626#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 8603#L35-2 [2024-10-13 16:57:34,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -103488292, now seen corresponding path program 2 times [2024-10-13 16:57:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:34,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224829104] [2024-10-13 16:57:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224829104] [2024-10-13 16:57:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224829104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504642511] [2024-10-13 16:57:34,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:34,325 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:34,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-13 16:57:34,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:34,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:34,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:34,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:34,417 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-13 16:57:34,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504642511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:34,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-13 16:57:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633780712] [2024-10-13 16:57:34,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:34,460 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:34,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash 112905049, now seen corresponding path program 1 times [2024-10-13 16:57:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:34,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283386147] [2024-10-13 16:57:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 16:57:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:57:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 16:57:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283386147] [2024-10-13 16:57:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283386147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332359146] [2024-10-13 16:57:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:34,675 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:34,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-13 16:57:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 16:57:34,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 16:57:34,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 16:57:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332359146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:35,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:35,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-13 16:57:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483704871] [2024-10-13 16:57:35,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:35,027 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 16:57:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 16:57:35,028 INFO L87 Difference]: Start difference. First operand 816 states and 1457 transitions. cyclomatic complexity: 661 Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:57:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:35,079 INFO L93 Difference]: Finished difference Result 868 states and 1539 transitions. [2024-10-13 16:57:35,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 868 states and 1539 transitions. [2024-10-13 16:57:35,088 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 157 [2024-10-13 16:57:35,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 868 states to 861 states and 1531 transitions. [2024-10-13 16:57:35,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2024-10-13 16:57:35,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2024-10-13 16:57:35,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1531 transitions. [2024-10-13 16:57:35,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:35,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 861 states and 1531 transitions. [2024-10-13 16:57:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1531 transitions. [2024-10-13 16:57:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 815. [2024-10-13 16:57:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 525 states have (on average 1.2361904761904763) internal successors, (649), 566 states have internal predecessors, (649), 197 states have call successors, (199), 86 states have call predecessors, (199), 93 states have return successors, (607), 162 states have call predecessors, (607), 177 states have call successors, (607) [2024-10-13 16:57:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1455 transitions. [2024-10-13 16:57:35,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 815 states and 1455 transitions. [2024-10-13 16:57:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 16:57:35,131 INFO L425 stractBuchiCegarLoop]: Abstraction has 815 states and 1455 transitions. [2024-10-13 16:57:35,131 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 16:57:35,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 815 states and 1455 transitions. [2024-10-13 16:57:35,136 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 147 [2024-10-13 16:57:35,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:35,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:35,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:35,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:35,138 INFO L745 eck$LassoCheckResult]: Stem: 10419#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 10368#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10365#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 10366#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10458#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10978#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10979#$Ultimate##0 ~p := #in~p;~q := #in~q; 10983#L20 assume ~p <= 0;#res := 1; 10981#partsFINAL assume true; 10977#partsEXIT >#71#return; 10959#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10958#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10950#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10952#$Ultimate##0 ~p := #in~p;~q := #in~q; 10954#L20 assume ~p <= 0;#res := 1; 10953#partsFINAL assume true; 10949#partsEXIT >#71#return; 10946#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10725#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 10724#L35-3 havoc main_~q~0#1; 10723#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10715#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10699#L35-2 [2024-10-13 16:57:35,138 INFO L747 eck$LassoCheckResult]: Loop: 10699#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10691#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10693#$Ultimate##0 ~p := #in~p;~q := #in~q; 10705#L20 assume !(~p <= 0); 10706#L21 assume ~q <= 0;#res := 0; 10962#partsFINAL assume true; 10961#partsEXIT >#71#return; 10681#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10680#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10463#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10469#$Ultimate##0 ~p := #in~p;~q := #in~q; 10623#L20 assume !(~p <= 0); 10619#L21 assume !(~q <= 0); 10540#L22 assume !(~q > ~p); 10505#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10603#$Ultimate##0 ~p := #in~p;~q := #in~q; 10637#L20 assume ~p <= 0;#res := 1; 10636#partsFINAL assume true; 10632#partsEXIT >#67#return; 10488#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10604#$Ultimate##0 ~p := #in~p;~q := #in~q; 10613#L20 assume !(~p <= 0); 10611#L21 assume ~q <= 0;#res := 0; 10600#partsFINAL assume true; 10601#partsEXIT >#69#return; 10524#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 10470#partsFINAL assume true; 10471#partsEXIT >#71#return; 10666#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10461#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 10462#L35-3 havoc main_~q~0#1; 10717#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10716#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10699#L35-2 [2024-10-13 16:57:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167415, now seen corresponding path program 3 times [2024-10-13 16:57:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715268178] [2024-10-13 16:57:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:35,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:35,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:35,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:35,149 INFO L85 PathProgramCache]: Analyzing trace with hash 112905049, now seen corresponding path program 2 times [2024-10-13 16:57:35,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:35,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424574425] [2024-10-13 16:57:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:35,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:57:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 16:57:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424574425] [2024-10-13 16:57:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424574425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117905415] [2024-10-13 16:57:35,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:35,288 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:35,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-13 16:57:35,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:35,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:35,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 16:57:35,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 16:57:35,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 16:57:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117905415] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:35,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-13 16:57:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462687479] [2024-10-13 16:57:35,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:35,640 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 16:57:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-13 16:57:35,641 INFO L87 Difference]: Start difference. First operand 815 states and 1455 transitions. cyclomatic complexity: 660 Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 16:57:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:36,009 INFO L93 Difference]: Finished difference Result 1101 states and 2036 transitions. [2024-10-13 16:57:36,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1101 states and 2036 transitions. [2024-10-13 16:57:36,063 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 182 [2024-10-13 16:57:36,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1101 states to 1026 states and 1936 transitions. [2024-10-13 16:57:36,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2024-10-13 16:57:36,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2024-10-13 16:57:36,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1936 transitions. [2024-10-13 16:57:36,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:36,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1936 transitions. [2024-10-13 16:57:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1936 transitions. [2024-10-13 16:57:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 831. [2024-10-13 16:57:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 542 states have (on average 1.2029520295202951) internal successors, (652), 577 states have internal predecessors, (652), 181 states have call successors, (183), 86 states have call predecessors, (183), 108 states have return successors, (641), 167 states have call predecessors, (641), 170 states have call successors, (641) [2024-10-13 16:57:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1476 transitions. [2024-10-13 16:57:36,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1476 transitions. [2024-10-13 16:57:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 16:57:36,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 831 states and 1476 transitions. [2024-10-13 16:57:36,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 16:57:36,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1476 transitions. [2024-10-13 16:57:36,114 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 116 [2024-10-13 16:57:36,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:36,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:36,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:36,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-13 16:57:36,116 INFO L745 eck$LassoCheckResult]: Stem: 12583#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 12538#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 12539#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12533#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 12534#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 12836#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12837#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 12856#$Ultimate##0 ~p := #in~p;~q := #in~q; 12866#L20 assume ~p <= 0;#res := 1; 12863#partsFINAL assume true; 12864#partsEXIT >#71#return; 12855#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12885#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12854#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 12883#$Ultimate##0 ~p := #in~p;~q := #in~q; 12886#L20 assume ~p <= 0;#res := 1; 12884#partsFINAL assume true; 12878#partsEXIT >#71#return; 12879#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12614#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 12615#L35-3 havoc main_~q~0#1; 13163#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13157#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13156#L35-2 [2024-10-13 16:57:36,116 INFO L747 eck$LassoCheckResult]: Loop: 13156#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12598#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13327#$Ultimate##0 ~p := #in~p;~q := #in~q; 12597#L20 assume !(~p <= 0); 12600#L21 assume ~q <= 0;#res := 0; 13328#partsFINAL assume true; 13325#partsEXIT >#71#return; 12957#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12954#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12912#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13070#$Ultimate##0 ~p := #in~p;~q := #in~q; 13068#L20 assume !(~p <= 0); 13066#L21 assume !(~q <= 0); 13065#L22 assume !(~q > ~p); 12939#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13060#$Ultimate##0 ~p := #in~p;~q := #in~q; 13076#L20 assume ~p <= 0;#res := 1; 13063#partsFINAL assume true; 13042#partsEXIT >#67#return; 12924#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13006#$Ultimate##0 ~p := #in~p;~q := #in~q; 13080#L20 assume !(~p <= 0); 13077#L21 assume ~q <= 0;#res := 0; 13079#partsFINAL assume true; 13259#partsEXIT >#69#return; 12997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13320#partsFINAL assume true; 12911#partsEXIT >#71#return; 12914#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12960#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12913#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13070#$Ultimate##0 ~p := #in~p;~q := #in~q; 13068#L20 assume !(~p <= 0); 13066#L21 assume !(~q <= 0); 13065#L22 assume !(~q > ~p); 12939#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13060#$Ultimate##0 ~p := #in~p;~q := #in~q; 13076#L20 assume ~p <= 0;#res := 1; 13063#partsFINAL assume true; 13042#partsEXIT >#67#return; 12924#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13006#$Ultimate##0 ~p := #in~p;~q := #in~q; 13080#L20 assume !(~p <= 0); 13077#L21 assume ~q <= 0;#res := 0; 13079#partsFINAL assume true; 13259#partsEXIT >#69#return; 12997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13320#partsFINAL assume true; 12911#partsEXIT >#71#return; 12612#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12613#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 13317#L35-3 havoc main_~q~0#1; 12549#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12550#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13156#L35-2 [2024-10-13 16:57:36,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167415, now seen corresponding path program 4 times [2024-10-13 16:57:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:36,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332016581] [2024-10-13 16:57:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:36,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:36,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 541134186, now seen corresponding path program 3 times [2024-10-13 16:57:36,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:36,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422720543] [2024-10-13 16:57:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:57:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 16:57:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:57:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-13 16:57:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:36,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422720543] [2024-10-13 16:57:36,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422720543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:36,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661820021] [2024-10-13 16:57:36,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:36,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:36,308 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-13 16:57:36,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 16:57:36,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:36,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:57:36,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-13 16:57:36,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-13 16:57:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661820021] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:36,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2024-10-13 16:57:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262371255] [2024-10-13 16:57:36,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:36,885 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 16:57:36,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-10-13 16:57:36,886 INFO L87 Difference]: Start difference. First operand 831 states and 1476 transitions. cyclomatic complexity: 665 Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 13 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-13 16:57:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:37,583 INFO L93 Difference]: Finished difference Result 1217 states and 2217 transitions. [2024-10-13 16:57:37,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1217 states and 2217 transitions. [2024-10-13 16:57:37,599 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 168 [2024-10-13 16:57:37,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1217 states to 1176 states and 2144 transitions. [2024-10-13 16:57:37,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2024-10-13 16:57:37,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-10-13 16:57:37,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1176 states and 2144 transitions. [2024-10-13 16:57:37,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:37,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1176 states and 2144 transitions. [2024-10-13 16:57:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states and 2144 transitions. [2024-10-13 16:57:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1013. [2024-10-13 16:57:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 668 states have (on average 1.18562874251497) internal successors, (792), 717 states have internal predecessors, (792), 196 states have call successors, (198), 96 states have call predecessors, (198), 149 states have return successors, (874), 199 states have call predecessors, (874), 185 states have call successors, (874) [2024-10-13 16:57:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1864 transitions. [2024-10-13 16:57:37,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1013 states and 1864 transitions. [2024-10-13 16:57:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-13 16:57:37,672 INFO L425 stractBuchiCegarLoop]: Abstraction has 1013 states and 1864 transitions. [2024-10-13 16:57:37,672 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 16:57:37,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1013 states and 1864 transitions. [2024-10-13 16:57:37,680 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 130 [2024-10-13 16:57:37,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:37,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:37,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:37,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:37,681 INFO L745 eck$LassoCheckResult]: Stem: 15080#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 15038#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 15039#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15032#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 15033#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 15097#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 15034#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 15035#$Ultimate##0 ~p := #in~p;~q := #in~q; 15724#L20 assume ~p <= 0;#res := 1; 15723#partsFINAL assume true; 15722#partsEXIT >#71#return; 15720#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 15719#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 15691#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 15734#$Ultimate##0 ~p := #in~p;~q := #in~q; 15834#L20 assume !(~p <= 0); 15833#L21 assume !(~q <= 0); 15694#L22 assume ~q > ~p; 15041#L22-1 call #t~ret0 := parts(~p, ~p);< 15692#$Ultimate##0 ~p := #in~p;~q := #in~q; 15091#L20 assume !(~p <= 0); 15092#L21 assume !(~q <= 0); 15876#L22 assume !(~q > ~p); 15040#L23 call #t~ret1 := parts(~p - ~q, ~q);< 15042#$Ultimate##0 [2024-10-13 16:57:37,681 INFO L747 eck$LassoCheckResult]: Loop: 15042#$Ultimate##0 ~p := #in~p;~q := #in~q; 15916#L20 assume !(~p <= 0); 15913#L21 assume !(~q <= 0); 15912#L22 assume !(~q > ~p); 15898#L23 call #t~ret1 := parts(~p - ~q, ~q);< 15042#$Ultimate##0 [2024-10-13 16:57:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -571940934, now seen corresponding path program 1 times [2024-10-13 16:57:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158783804] [2024-10-13 16:57:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 16:57:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158783804] [2024-10-13 16:57:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158783804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:57:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842651872] [2024-10-13 16:57:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:37,724 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash 28756503, now seen corresponding path program 1 times [2024-10-13 16:57:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554913957] [2024-10-13 16:57:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:37,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:37,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:37,792 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:37,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:37,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:37,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:37,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:37,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:37,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:37,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:37,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2024-10-13 16:57:37,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:37,794 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:37,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:37,852 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:37,852 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:37,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:37,854 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:37,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 16:57:37,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:37,856 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:37,867 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:37,867 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:37,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:37,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:37,879 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:37,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 16:57:37,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:37,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:37,893 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:37,893 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:37,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:37,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:37,910 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:37,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 16:57:37,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:37,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:37,929 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:37,929 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:37,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:37,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:37,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:37,946 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:37,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 16:57:37,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:37,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:37,965 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:37,965 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:37,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:37,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:37,979 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:37,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 16:57:37,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:37,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:37,992 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:37,992 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:38,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-13 16:57:38,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,004 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 16:57:38,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:38,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:38,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,028 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 16:57:38,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:38,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:38,090 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:38,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:38,095 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:38,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:38,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:38,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:38,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:38,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,095 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:38,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:38,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2024-10-13 16:57:38,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:38,095 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:38,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,148 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:38,148 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:38,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,150 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 16:57:38,151 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-13 16:57:38,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:38,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:38,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:38,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:38,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:38,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:38,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:38,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:38,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:38,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,175 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 16:57:38,178 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-13 16:57:38,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:38,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:38,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:38,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:38,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:38,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:38,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:38,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:38,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-13 16:57:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,204 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 16:57:38,206 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-13 16:57:38,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:38,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:38,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:38,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:38,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:38,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:38,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:38,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:38,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:38,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,231 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 16:57:38,232 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-13 16:57:38,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:38,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:38,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:38,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:38,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:38,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:38,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:38,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:38,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:38,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,264 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 16:57:38,268 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-13 16:57:38,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:38,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:38,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:38,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:38,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:38,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:38,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:38,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:38,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 16:57:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,312 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 16:57:38,313 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-13 16:57:38,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:38,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:38,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:38,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:38,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:38,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:38,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:38,326 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:38,330 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:38,330 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,331 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 16:57:38,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:38,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:38,334 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:38,334 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2024-10-13 16:57:38,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-13 16:57:38,345 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:38,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:38,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:38,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:38,511 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-13 16:57:38,511 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:38,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1013 states and 1864 transitions. cyclomatic complexity: 874 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:38,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1013 states and 1864 transitions. cyclomatic complexity: 874. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 1516 states and 2804 transitions. Complement of second has 30 states. [2024-10-13 16:57:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2024-10-13 16:57:38,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 24 letters. Loop has 5 letters. [2024-10-13 16:57:38,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:38,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 29 letters. Loop has 5 letters. [2024-10-13 16:57:38,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:38,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 24 letters. Loop has 10 letters. [2024-10-13 16:57:38,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:38,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1516 states and 2804 transitions. [2024-10-13 16:57:38,633 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 136 [2024-10-13 16:57:38,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1516 states to 1358 states and 2570 transitions. [2024-10-13 16:57:38,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2024-10-13 16:57:38,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-10-13 16:57:38,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1358 states and 2570 transitions. [2024-10-13 16:57:38,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:38,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1358 states and 2570 transitions. [2024-10-13 16:57:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states and 2570 transitions. [2024-10-13 16:57:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1314. [2024-10-13 16:57:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 880 states have (on average 1.2159090909090908) internal successors, (1070), 974 states have internal predecessors, (1070), 255 states have call successors, (257), 134 states have call predecessors, (257), 179 states have return successors, (1134), 205 states have call predecessors, (1134), 243 states have call successors, (1134) [2024-10-13 16:57:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2461 transitions. [2024-10-13 16:57:38,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1314 states and 2461 transitions. [2024-10-13 16:57:38,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 16:57:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 16:57:38,702 INFO L87 Difference]: Start difference. First operand 1314 states and 2461 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:57:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:38,735 INFO L93 Difference]: Finished difference Result 1062 states and 1988 transitions. [2024-10-13 16:57:38,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1062 states and 1988 transitions. [2024-10-13 16:57:38,745 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 88 [2024-10-13 16:57:38,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1062 states to 1046 states and 1971 transitions. [2024-10-13 16:57:38,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2024-10-13 16:57:38,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2024-10-13 16:57:38,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1046 states and 1971 transitions. [2024-10-13 16:57:38,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:38,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1046 states and 1971 transitions. [2024-10-13 16:57:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states and 1971 transitions. [2024-10-13 16:57:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2024-10-13 16:57:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 703 states have (on average 1.2147937411095306) internal successors, (854), 776 states have internal predecessors, (854), 190 states have call successors, (191), 101 states have call predecessors, (191), 151 states have return successors, (924), 166 states have call predecessors, (924), 190 states have call successors, (924) [2024-10-13 16:57:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1969 transitions. [2024-10-13 16:57:38,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1044 states and 1969 transitions. [2024-10-13 16:57:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 16:57:38,796 INFO L425 stractBuchiCegarLoop]: Abstraction has 1044 states and 1969 transitions. [2024-10-13 16:57:38,796 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 16:57:38,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1044 states and 1969 transitions. [2024-10-13 16:57:38,802 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 88 [2024-10-13 16:57:38,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:38,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:38,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:38,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:38,803 INFO L745 eck$LassoCheckResult]: Stem: 20140#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20094#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 20095#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 20092#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 20093#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20159#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20652#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20653#$Ultimate##0 ~p := #in~p;~q := #in~q; 20657#L20 assume ~p <= 0;#res := 1; 20656#partsFINAL assume true; 20651#partsEXIT >#71#return; 20649#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20438#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20439#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20461#$Ultimate##0 ~p := #in~p;~q := #in~q; 20507#L20 assume ~p <= 0;#res := 1; 20505#partsFINAL assume true; 20459#partsEXIT >#71#return; 20402#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20400#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 20397#L35-3 havoc main_~q~0#1; 20368#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20364#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20358#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20351#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20354#$Ultimate##0 ~p := #in~p;~q := #in~q; 20361#L20 assume ~p <= 0;#res := 1; 20356#partsFINAL assume true; 20350#partsEXIT >#71#return; 20348#L36-1 [2024-10-13 16:57:38,803 INFO L747 eck$LassoCheckResult]: Loop: 20348#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20346#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20079#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20343#$Ultimate##0 ~p := #in~p;~q := #in~q; 20342#L20 assume ~p <= 0;#res := 1; 20341#partsFINAL assume true; 20352#partsEXIT >#71#return; 20348#L36-1 [2024-10-13 16:57:38,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash -537230682, now seen corresponding path program 5 times [2024-10-13 16:57:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:38,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346409184] [2024-10-13 16:57:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 16:57:38,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346409184] [2024-10-13 16:57:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346409184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:57:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326191042] [2024-10-13 16:57:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:38,851 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 283574208, now seen corresponding path program 2 times [2024-10-13 16:57:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767695650] [2024-10-13 16:57:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:38,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:38,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:38,909 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:38,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:38,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:38,909 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:38,909 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:38,909 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,909 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:38,909 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:38,909 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2024-10-13 16:57:38,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:38,910 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:38,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:38,936 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:38,936 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:38,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,939 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 16:57:38,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:38,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:38,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-13 16:57:38,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:38,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-13 16:57:38,988 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 16:57:38,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:38,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,272 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:39,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-13 16:57:39,278 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:39,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:39,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:39,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:39,278 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:39,278 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,278 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:39,278 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:39,278 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2024-10-13 16:57:39,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:39,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:39,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,309 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:39,309 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,313 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 16:57:39,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-13 16:57:39,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:39,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:39,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:39,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:39,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:39,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:39,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:39,327 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:39,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:39,329 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,330 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 16:57:39,331 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:39,331 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:39,331 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:39,332 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~q~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~q~0#1 Supporting invariants [] [2024-10-13 16:57:39,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:39,342 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:39,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:39,534 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-13 16:57:39,535 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:39,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:39,591 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1057 states and 1983 transitions. Complement of second has 10 states. [2024-10-13 16:57:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-10-13 16:57:39,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 29 letters. Loop has 7 letters. [2024-10-13 16:57:39,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:39,593 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:39,776 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-13 16:57:39,776 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:39,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:39,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1055 states and 1980 transitions. Complement of second has 10 states. [2024-10-13 16:57:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2024-10-13 16:57:39,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 29 letters. Loop has 7 letters. [2024-10-13 16:57:39,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:39,836 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:39,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:40,027 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-13 16:57:40,027 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:40,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:40,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1991 states and 3830 transitions. Complement of second has 11 states. [2024-10-13 16:57:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2024-10-13 16:57:40,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 29 letters. Loop has 7 letters. [2024-10-13 16:57:40,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:40,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 36 letters. Loop has 7 letters. [2024-10-13 16:57:40,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:40,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 29 letters. Loop has 14 letters. [2024-10-13 16:57:40,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:40,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1991 states and 3830 transitions. [2024-10-13 16:57:40,141 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-10-13 16:57:40,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1991 states to 1609 states and 2925 transitions. [2024-10-13 16:57:40,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2024-10-13 16:57:40,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-10-13 16:57:40,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1609 states and 2925 transitions. [2024-10-13 16:57:40,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:40,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1609 states and 2925 transitions. [2024-10-13 16:57:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 2925 transitions. [2024-10-13 16:57:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1533. [2024-10-13 16:57:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1035 states have (on average 1.2115942028985507) internal successors, (1254), 1144 states have internal predecessors, (1254), 295 states have call successors, (315), 165 states have call predecessors, (315), 203 states have return successors, (1235), 223 states have call predecessors, (1235), 278 states have call successors, (1235) [2024-10-13 16:57:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2804 transitions. [2024-10-13 16:57:40,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1533 states and 2804 transitions. [2024-10-13 16:57:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:40,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:57:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:57:40,218 INFO L87 Difference]: Start difference. First operand 1533 states and 2804 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:57:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:40,279 INFO L93 Difference]: Finished difference Result 879 states and 1532 transitions. [2024-10-13 16:57:40,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 879 states and 1532 transitions. [2024-10-13 16:57:40,288 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-10-13 16:57:40,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 879 states to 496 states and 873 transitions. [2024-10-13 16:57:40,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2024-10-13 16:57:40,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2024-10-13 16:57:40,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 873 transitions. [2024-10-13 16:57:40,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:40,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 496 states and 873 transitions. [2024-10-13 16:57:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 873 transitions. [2024-10-13 16:57:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 478. [2024-10-13 16:57:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 331 states have (on average 1.1993957703927491) internal successors, (397), 353 states have internal predecessors, (397), 87 states have call successors, (94), 57 states have call predecessors, (94), 60 states have return successors, (356), 67 states have call predecessors, (356), 81 states have call successors, (356) [2024-10-13 16:57:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 847 transitions. [2024-10-13 16:57:40,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 478 states and 847 transitions. [2024-10-13 16:57:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:57:40,310 INFO L425 stractBuchiCegarLoop]: Abstraction has 478 states and 847 transitions. [2024-10-13 16:57:40,310 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 16:57:40,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 847 transitions. [2024-10-13 16:57:40,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-10-13 16:57:40,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:40,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:40,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:40,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:40,315 INFO L745 eck$LassoCheckResult]: Stem: 28118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 28062#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 28063#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 28055#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 28056#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28141#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28179#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28180#$Ultimate##0 ~p := #in~p;~q := #in~q; 28184#L20 assume ~p <= 0;#res := 1; 28182#partsFINAL assume true; 28178#partsEXIT >#71#return; 28176#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28175#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28160#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28165#$Ultimate##0 ~p := #in~p;~q := #in~q; 28162#L20 assume ~p <= 0;#res := 1; 28159#partsFINAL assume true; 28161#partsEXIT >#71#return; 28186#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28259#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 28258#L35-3 havoc main_~q~0#1; 28069#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28070#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28230#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28057#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28058#$Ultimate##0 ~p := #in~p;~q := #in~q; 28292#L20 assume !(~p <= 0); 28291#L21 assume ~q <= 0;#res := 0; 28242#partsFINAL assume true; 28158#partsEXIT >#71#return; 28137#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28132#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28059#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28060#$Ultimate##0 ~p := #in~p;~q := #in~q; 28217#L20 assume !(~p <= 0); 28215#L21 assume !(~q <= 0); 28213#L22 assume !(~q > ~p); 28095#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28400#$Ultimate##0 ~p := #in~p;~q := #in~q; 28421#L20 assume ~p <= 0;#res := 1; 28464#partsFINAL assume true; 28463#partsEXIT >#67#return; 28034#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 28211#$Ultimate##0 [2024-10-13 16:57:40,315 INFO L747 eck$LassoCheckResult]: Loop: 28211#$Ultimate##0 ~p := #in~p;~q := #in~q; 28447#L20 assume !(~p <= 0); 28448#L21 assume !(~q <= 0); 28443#L22 assume !(~q > ~p); 28044#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28459#$Ultimate##0 ~p := #in~p;~q := #in~q; 28462#L20 assume ~p <= 0;#res := 1; 28461#partsFINAL assume true; 28458#partsEXIT >#67#return; 28036#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 28211#$Ultimate##0 [2024-10-13 16:57:40,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1463979575, now seen corresponding path program 1 times [2024-10-13 16:57:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112576061] [2024-10-13 16:57:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:40,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2050528601, now seen corresponding path program 1 times [2024-10-13 16:57:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:40,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69063360] [2024-10-13 16:57:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1784633359, now seen corresponding path program 2 times [2024-10-13 16:57:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742441767] [2024-10-13 16:57:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:40,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:57:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 16:57:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-13 16:57:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742441767] [2024-10-13 16:57:40,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742441767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254975102] [2024-10-13 16:57:40,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:40,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:40,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,447 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-10-13 16:57:40,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:40,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:40,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:57:40,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 16:57:40,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-13 16:57:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254975102] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:40,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2024-10-13 16:57:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042494492] [2024-10-13 16:57:40,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:40,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 16:57:40,716 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:40,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:40,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:40,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:40,717 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:40,717 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,717 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:40,717 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:40,717 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2024-10-13 16:57:40,717 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:40,717 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:40,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:40,775 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:40,776 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,778 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 16:57:40,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:40,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:40,795 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:40,795 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:40,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:40,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,813 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-13 16:57:40,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:40,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:40,829 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:40,829 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:40,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:40,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,845 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-13 16:57:40,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:40,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:40,861 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:40,861 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:40,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-13 16:57:40,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,877 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-13 16:57:40,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:40,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:40,896 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:40,896 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:40,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-13 16:57:40,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,912 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-13 16:57:40,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:40,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:40,928 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:40,928 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:40,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:40,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,944 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-13 16:57:40,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:40,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:40,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-13 16:57:40,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,975 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-13 16:57:40,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:40,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:41,147 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:41,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:41,152 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:41,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:41,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:41,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:41,152 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:41,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:41,153 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:41,153 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2024-10-13 16:57:41,153 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:41,153 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:41,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,198 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:41,198 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:41,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,200 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-13 16:57:41,201 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-13 16:57:41,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:41,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:41,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:41,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:41,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-13 16:57:41,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,224 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-13 16:57:41,225 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-13 16:57:41,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:41,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:41,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:41,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:41,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-13 16:57:41,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,249 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-13 16:57:41,251 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-13 16:57:41,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:41,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:41,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:41,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:41,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,274 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-13 16:57:41,276 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-13 16:57:41,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:41,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:41,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:41,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:41,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:41,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,299 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-13 16:57:41,300 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-13 16:57:41,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:41,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:41,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:41,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:41,316 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:41,316 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,317 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-13 16:57:41,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:41,318 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:41,318 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:41,319 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-10-13 16:57:41,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:41,329 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:41,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:57:41,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:57:41,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:41,580 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:41,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 847 transitions. cyclomatic complexity: 389 Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:41,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 847 transitions. cyclomatic complexity: 389. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1817 states and 3566 transitions. Complement of second has 43 states. [2024-10-13 16:57:41,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2024-10-13 16:57:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 43 letters. Loop has 10 letters. [2024-10-13 16:57:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 53 letters. Loop has 10 letters. [2024-10-13 16:57:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 43 letters. Loop has 20 letters. [2024-10-13 16:57:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:41,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 3566 transitions. [2024-10-13 16:57:41,809 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 107 [2024-10-13 16:57:41,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1431 states and 2862 transitions. [2024-10-13 16:57:41,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2024-10-13 16:57:41,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2024-10-13 16:57:41,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1431 states and 2862 transitions. [2024-10-13 16:57:41,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:41,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1431 states and 2862 transitions. [2024-10-13 16:57:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states and 2862 transitions. [2024-10-13 16:57:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1145. [2024-10-13 16:57:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 780 states have (on average 1.2294871794871796) internal successors, (959), 848 states have internal predecessors, (959), 234 states have call successors, (241), 138 states have call predecessors, (241), 131 states have return successors, (896), 158 states have call predecessors, (896), 214 states have call successors, (896) [2024-10-13 16:57:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2096 transitions. [2024-10-13 16:57:41,876 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1145 states and 2096 transitions. [2024-10-13 16:57:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 16:57:41,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:57:41,877 INFO L87 Difference]: Start difference. First operand 1145 states and 2096 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 16:57:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:41,958 INFO L93 Difference]: Finished difference Result 1326 states and 2340 transitions. [2024-10-13 16:57:41,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 2340 transitions. [2024-10-13 16:57:41,967 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 117 [2024-10-13 16:57:41,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1286 states and 2285 transitions. [2024-10-13 16:57:41,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2024-10-13 16:57:41,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2024-10-13 16:57:41,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1286 states and 2285 transitions. [2024-10-13 16:57:41,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:41,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1286 states and 2285 transitions. [2024-10-13 16:57:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states and 2285 transitions. [2024-10-13 16:57:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1248. [2024-10-13 16:57:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 846 states have (on average 1.2257683215130024) internal successors, (1037), 924 states have internal predecessors, (1037), 256 states have call successors, (265), 150 states have call predecessors, (265), 146 states have return successors, (937), 173 states have call predecessors, (937), 231 states have call successors, (937) [2024-10-13 16:57:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2239 transitions. [2024-10-13 16:57:42,020 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1248 states and 2239 transitions. [2024-10-13 16:57:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 16:57:42,021 INFO L425 stractBuchiCegarLoop]: Abstraction has 1248 states and 2239 transitions. [2024-10-13 16:57:42,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-13 16:57:42,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1248 states and 2239 transitions. [2024-10-13 16:57:42,026 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 114 [2024-10-13 16:57:42,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:42,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:42,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:42,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:42,027 INFO L745 eck$LassoCheckResult]: Stem: 33454#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 33420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 33421#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 33413#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 33414#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 33486#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33573#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33574#$Ultimate##0 ~p := #in~p;~q := #in~q; 33576#L20 assume ~p <= 0;#res := 1; 33575#partsFINAL assume true; 33572#partsEXIT >#71#return; 33565#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33562#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33507#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33528#$Ultimate##0 ~p := #in~p;~q := #in~q; 33509#L20 assume ~p <= 0;#res := 1; 33506#partsFINAL assume true; 33508#partsEXIT >#71#return; 33489#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33472#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 33433#L35-3 havoc main_~q~0#1; 33434#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 33637#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 33487#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33488#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33627#$Ultimate##0 ~p := #in~p;~q := #in~q; 33632#L20 assume !(~p <= 0); 33631#L21 assume ~q <= 0;#res := 0; 33492#partsFINAL assume true; 33493#partsEXIT >#71#return; 33606#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33604#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33443#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33601#$Ultimate##0 ~p := #in~p;~q := #in~q; 34331#L20 assume !(~p <= 0); 34328#L21 assume !(~q <= 0); 34325#L22 assume ~q > ~p; 33440#L22-1 call #t~ret0 := parts(~p, ~p);< 33442#$Ultimate##0 ~p := #in~p;~q := #in~q; 34228#L20 assume !(~p <= 0); 34216#L21 assume !(~q <= 0); 34193#L22 assume !(~q > ~p); 33537#L23 call #t~ret1 := parts(~p - ~q, ~q);< 34160#$Ultimate##0 ~p := #in~p;~q := #in~q; 34161#L20 assume ~p <= 0;#res := 1; 34244#partsFINAL assume true; 34241#partsEXIT >#67#return; 33423#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 34238#$Ultimate##0 ~p := #in~p;~q := #in~q; 34239#L20 assume !(~p <= 0); 34248#L21 assume !(~q <= 0); 33431#L22 [2024-10-13 16:57:42,027 INFO L747 eck$LassoCheckResult]: Loop: 33431#L22 assume !(~q > ~p); 33422#L23 call #t~ret1 := parts(~p - ~q, ~q);< 33425#$Ultimate##0 ~p := #in~p;~q := #in~q; 33437#L20 assume !(~p <= 0); 33435#L21 assume !(~q <= 0); 33431#L22 [2024-10-13 16:57:42,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 813232914, now seen corresponding path program 1 times [2024-10-13 16:57:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:42,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507793525] [2024-10-13 16:57:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 16:57:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-13 16:57:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507793525] [2024-10-13 16:57:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507793525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053604154] [2024-10-13 16:57:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,086 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-10-13 16:57:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:42,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-13 16:57:42,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-13 16:57:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053604154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:42,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-10-13 16:57:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094738216] [2024-10-13 16:57:42,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:42,191 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:42,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 43524783, now seen corresponding path program 2 times [2024-10-13 16:57:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:42,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451192045] [2024-10-13 16:57:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:42,280 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:42,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:42,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:42,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:42,281 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:42,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:42,281 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:42,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2024-10-13 16:57:42,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:42,282 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:42,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-13 16:57:42,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:42,377 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,379 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-13 16:57:42,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,397 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,397 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,413 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-13 16:57:42,431 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,431 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,447 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-13 16:57:42,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-13 16:57:42,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,493 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-13 16:57:42,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:42,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,161 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:49,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-13 16:57:49,170 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:49,170 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:49,170 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:49,170 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:49,170 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:49,170 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,170 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:49,170 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:49,170 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2024-10-13 16:57:49,170 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:49,170 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:49,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,220 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:49,221 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:49,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,223 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-13 16:57:49,224 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-13 16:57:49,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:49,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:49,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:49,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:49,241 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:49,241 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:49,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,242 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-13 16:57:49,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:49,244 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:49,244 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:49,244 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2024-10-13 16:57:49,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-13 16:57:49,254 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:49,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:49,504 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-13 16:57:49,504 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:49,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:57:49,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1305 states and 2307 transitions. Complement of second has 15 states. [2024-10-13 16:57:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:57:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-10-13 16:57:49,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 51 letters. Loop has 5 letters. [2024-10-13 16:57:49,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:49,590 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:49,839 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-13 16:57:49,840 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:49,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:57:49,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1305 states and 2307 transitions. Complement of second has 15 states. [2024-10-13 16:57:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:57:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-10-13 16:57:49,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 51 letters. Loop has 5 letters. [2024-10-13 16:57:49,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:49,920 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:49,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:50,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,169 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-13 16:57:50,170 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:57:50,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:57:50,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1957 states and 3620 transitions. Complement of second has 20 states. [2024-10-13 16:57:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:57:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2024-10-13 16:57:50,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 51 letters. Loop has 5 letters. [2024-10-13 16:57:50,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 56 letters. Loop has 5 letters. [2024-10-13 16:57:50,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 51 letters. Loop has 10 letters. [2024-10-13 16:57:50,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1957 states and 3620 transitions. [2024-10-13 16:57:50,293 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 129 [2024-10-13 16:57:50,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1957 states to 1570 states and 3178 transitions. [2024-10-13 16:57:50,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2024-10-13 16:57:50,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2024-10-13 16:57:50,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1570 states and 3178 transitions. [2024-10-13 16:57:50,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:50,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1570 states and 3178 transitions. [2024-10-13 16:57:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states and 3178 transitions. [2024-10-13 16:57:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1355. [2024-10-13 16:57:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 897 states have (on average 1.274247491638796) internal successors, (1143), 1004 states have internal predecessors, (1143), 314 states have call successors, (323), 176 states have call predecessors, (323), 144 states have return successors, (926), 174 states have call predecessors, (926), 291 states have call successors, (926) [2024-10-13 16:57:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2392 transitions. [2024-10-13 16:57:50,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1355 states and 2392 transitions. [2024-10-13 16:57:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 16:57:50,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:57:50,375 INFO L87 Difference]: Start difference. First operand 1355 states and 2392 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:50,485 INFO L93 Difference]: Finished difference Result 1374 states and 2399 transitions. [2024-10-13 16:57:50,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1374 states and 2399 transitions. [2024-10-13 16:57:50,496 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 110 [2024-10-13 16:57:50,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-13 16:57:50,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1374 states to 1356 states and 2379 transitions. [2024-10-13 16:57:50,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2024-10-13 16:57:50,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2024-10-13 16:57:50,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1356 states and 2379 transitions. [2024-10-13 16:57:50,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:50,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1356 states and 2379 transitions. [2024-10-13 16:57:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states and 2379 transitions. [2024-10-13 16:57:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1327. [2024-10-13 16:57:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 878 states have (on average 1.2710706150341686) internal successors, (1116), 982 states have internal predecessors, (1116), 306 states have call successors, (313), 172 states have call predecessors, (313), 143 states have return successors, (906), 172 states have call predecessors, (906), 287 states have call successors, (906) [2024-10-13 16:57:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2335 transitions. [2024-10-13 16:57:50,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1327 states and 2335 transitions. [2024-10-13 16:57:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 16:57:50,582 INFO L425 stractBuchiCegarLoop]: Abstraction has 1327 states and 2335 transitions. [2024-10-13 16:57:50,582 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-13 16:57:50,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1327 states and 2335 transitions. [2024-10-13 16:57:50,587 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2024-10-13 16:57:50,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:50,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:50,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:50,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:50,589 INFO L745 eck$LassoCheckResult]: Stem: 42931#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 42885#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 42886#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 42883#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 42884#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42959#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 43044#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43045#$Ultimate##0 ~p := #in~p;~q := #in~q; 43047#L20 assume ~p <= 0;#res := 1; 43046#partsFINAL assume true; 43043#partsEXIT >#71#return; 43025#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43023#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42983#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43003#$Ultimate##0 ~p := #in~p;~q := #in~q; 42985#L20 assume ~p <= 0;#res := 1; 42982#partsFINAL assume true; 42984#partsEXIT >#71#return; 43055#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42960#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 42961#L35-3 havoc main_~q~0#1; 42897#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42898#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42932#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42933#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 42972#$Ultimate##0 ~p := #in~p;~q := #in~q; 42973#L20 assume !(~p <= 0); 42969#L21 assume ~q <= 0;#res := 0; 42967#partsFINAL assume true; 42968#partsEXIT >#71#return; 43149#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43147#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 43123#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43125#$Ultimate##0 ~p := #in~p;~q := #in~q; 43218#L20 assume !(~p <= 0); 43216#L21 assume !(~q <= 0); 43215#L22 assume !(~q > ~p); 43165#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43166#$Ultimate##0 ~p := #in~p;~q := #in~q; 43185#L20 assume ~p <= 0;#res := 1; 43184#partsFINAL assume true; 43164#partsEXIT >#67#return; 43131#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43134#$Ultimate##0 ~p := #in~p;~q := #in~q; 43183#L20 assume !(~p <= 0); 43181#L21 assume ~q <= 0;#res := 0; 43140#partsFINAL assume true; 43130#partsEXIT >#69#return; 43128#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 43126#partsFINAL assume true; 43122#partsEXIT >#71#return; 43024#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43022#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42975#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43028#$Ultimate##0 ~p := #in~p;~q := #in~q; 43029#L20 assume !(~p <= 0); 43008#L21 assume !(~q <= 0); 43009#L22 assume ~q > ~p; 42990#L22-1 call #t~ret0 := parts(~p, ~p);< 43002#$Ultimate##0 ~p := #in~p;~q := #in~q; 43235#L20 assume !(~p <= 0); 43541#L21 assume !(~q <= 0); 43540#L22 assume !(~q > ~p); 43527#L23 [2024-10-13 16:57:50,589 INFO L747 eck$LassoCheckResult]: Loop: 43527#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43528#$Ultimate##0 ~p := #in~p;~q := #in~q; 43532#L20 assume ~p <= 0;#res := 1; 43530#partsFINAL assume true; 43526#partsEXIT >#67#return; 43330#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43402#$Ultimate##0 ~p := #in~p;~q := #in~q; 43499#L20 assume !(~p <= 0); 43496#L21 assume !(~q <= 0); 43497#L22 assume !(~q > ~p); 43527#L23 [2024-10-13 16:57:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1115927007, now seen corresponding path program 1 times [2024-10-13 16:57:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278386241] [2024-10-13 16:57:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 16:57:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:57:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 16:57:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278386241] [2024-10-13 16:57:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278386241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:50,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600486013] [2024-10-13 16:57:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:50,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,698 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-10-13 16:57:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:50,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 16:57:50,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 16:57:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600486013] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:50,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-10-13 16:57:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799393462] [2024-10-13 16:57:50,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:50,891 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -172323367, now seen corresponding path program 2 times [2024-10-13 16:57:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200412959] [2024-10-13 16:57:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:51,027 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:51,027 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:51,027 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:51,027 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:51,028 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:51,028 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,028 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:51,028 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:51,028 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2024-10-13 16:57:51,028 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:51,028 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:51,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,088 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:51,088 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,090 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-13 16:57:51,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:51,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:51,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-13 16:57:51,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,122 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-13 16:57:51,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:51,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:51,764 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:51,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,770 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:51,770 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:51,770 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:51,770 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:51,770 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:51,770 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,770 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:51,770 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:51,770 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2024-10-13 16:57:51,770 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:51,770 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:51,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,831 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:51,831 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:51,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,832 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-13 16:57:51,834 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-13 16:57:51,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:51,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:51,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:51,849 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:51,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:51,851 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,853 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-13 16:57:51,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:51,854 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:51,854 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:51,854 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2024-10-13 16:57:51,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,864 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,211 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-10-13 16:57:52,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:52,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 4172 states and 7487 transitions. Complement of second has 23 states. [2024-10-13 16:57:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-10-13 16:57:52,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 63 letters. Loop has 10 letters. [2024-10-13 16:57:52,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,363 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:52,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,774 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2024-10-13 16:57:52,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:52,941 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 4094 states and 7449 transitions. Complement of second has 25 states. [2024-10-13 16:57:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2024-10-13 16:57:52,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 63 letters. Loop has 10 letters. [2024-10-13 16:57:52,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,942 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:53,317 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-10-13 16:57:53,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:53,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 9334 states and 15635 transitions. Complement of second has 102 states. [2024-10-13 16:57:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2024-10-13 16:57:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 63 letters. Loop has 10 letters. [2024-10-13 16:57:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 73 letters. Loop has 10 letters. [2024-10-13 16:57:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 63 letters. Loop has 20 letters. [2024-10-13 16:57:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:53,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9334 states and 15635 transitions. [2024-10-13 16:57:53,761 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2024-10-13 16:57:53,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9334 states to 5775 states and 10049 transitions. [2024-10-13 16:57:53,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2024-10-13 16:57:53,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2024-10-13 16:57:53,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5775 states and 10049 transitions. [2024-10-13 16:57:53,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:53,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5775 states and 10049 transitions. [2024-10-13 16:57:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states and 10049 transitions. [2024-10-13 16:57:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4678. [2024-10-13 16:57:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4678 states, 2807 states have (on average 1.2582828642679016) internal successors, (3532), 3388 states have internal predecessors, (3532), 1395 states have call successors, (1478), 611 states have call predecessors, (1478), 476 states have return successors, (2680), 678 states have call predecessors, (2680), 1346 states have call successors, (2680) [2024-10-13 16:57:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 7690 transitions. [2024-10-13 16:57:54,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4678 states and 7690 transitions. [2024-10-13 16:57:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:54,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 16:57:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 16:57:54,113 INFO L87 Difference]: Start difference. First operand 4678 states and 7690 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-13 16:57:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:54,213 INFO L93 Difference]: Finished difference Result 4727 states and 7780 transitions. [2024-10-13 16:57:54,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4727 states and 7780 transitions. [2024-10-13 16:57:54,245 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 154 [2024-10-13 16:57:54,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4727 states to 4711 states and 7761 transitions. [2024-10-13 16:57:54,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2024-10-13 16:57:54,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2024-10-13 16:57:54,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4711 states and 7761 transitions. [2024-10-13 16:57:54,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:54,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4711 states and 7761 transitions. [2024-10-13 16:57:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states and 7761 transitions. [2024-10-13 16:57:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4681. [2024-10-13 16:57:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4681 states, 2809 states have (on average 1.2580989676041296) internal successors, (3534), 3390 states have internal predecessors, (3534), 1396 states have call successors, (1479), 611 states have call predecessors, (1479), 476 states have return successors, (2681), 679 states have call predecessors, (2681), 1347 states have call successors, (2681) [2024-10-13 16:57:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 7694 transitions. [2024-10-13 16:57:54,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4681 states and 7694 transitions. [2024-10-13 16:57:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 16:57:54,424 INFO L425 stractBuchiCegarLoop]: Abstraction has 4681 states and 7694 transitions. [2024-10-13 16:57:54,424 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-13 16:57:54,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4681 states and 7694 transitions. [2024-10-13 16:57:54,437 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 141 [2024-10-13 16:57:54,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:54,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:54,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:54,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-13 16:57:54,439 INFO L745 eck$LassoCheckResult]: Stem: 72525#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 72476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 72477#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 72474#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 72475#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72547#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74668#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 74669#$Ultimate##0 ~p := #in~p;~q := #in~q; 74671#L20 assume ~p <= 0;#res := 1; 74670#partsFINAL assume true; 74667#partsEXIT >#71#return; 74666#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74664#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74662#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72585#$Ultimate##0 ~p := #in~p;~q := #in~q; 74665#L20 assume ~p <= 0;#res := 1; 74663#partsFINAL assume true; 74661#partsEXIT >#71#return; 73951#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 73935#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72561#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72573#$Ultimate##0 ~p := #in~p;~q := #in~q; 72570#L20 assume ~p <= 0;#res := 1; 72571#partsFINAL assume true; 72560#partsEXIT >#71#return; 72550#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72526#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 72494#L35-3 havoc main_~q~0#1; 72495#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74554#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72548#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72549#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72558#$Ultimate##0 ~p := #in~p;~q := #in~q; 72559#L20 assume !(~p <= 0); 72555#L21 assume ~q <= 0;#res := 0; 72553#partsFINAL assume true; 72554#partsEXIT >#71#return; 74542#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74538#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72465#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 74534#$Ultimate##0 ~p := #in~p;~q := #in~q; 74585#L20 assume !(~p <= 0); 74583#L21 assume !(~q <= 0); 74581#L22 assume !(~q > ~p); 74578#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74579#$Ultimate##0 ~p := #in~p;~q := #in~q; 74587#L20 assume ~p <= 0;#res := 1; 74586#partsFINAL assume true; 74577#partsEXIT >#67#return; 74544#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 74545#$Ultimate##0 ~p := #in~p;~q := #in~q; 74576#L20 assume !(~p <= 0); 74575#L21 assume ~q <= 0;#res := 0; 74574#partsFINAL assume true; 74543#partsEXIT >#69#return; 74539#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 74535#partsFINAL assume true; 74532#partsEXIT >#71#return; 73205#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 73204#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72562#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72563#$Ultimate##0 ~p := #in~p;~q := #in~q; 72675#L20 assume !(~p <= 0); 72640#L21 assume !(~q <= 0); 72630#L22 assume !(~q > ~p); 72616#L23 call #t~ret1 := parts(~p - ~q, ~q);< 72791#$Ultimate##0 ~p := #in~p;~q := #in~q; 73101#L20 assume !(~p <= 0); 73102#L21 assume !(~q <= 0); 72989#L22 assume !(~q > ~p); 72990#L23 [2024-10-13 16:57:54,439 INFO L747 eck$LassoCheckResult]: Loop: 72990#L23 call #t~ret1 := parts(~p - ~q, ~q);< 73109#$Ultimate##0 ~p := #in~p;~q := #in~q; 73131#L20 assume ~p <= 0;#res := 1; 73130#partsFINAL assume true; 73106#partsEXIT >#67#return; 72988#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 73103#$Ultimate##0 ~p := #in~p;~q := #in~q; 73104#L20 assume !(~p <= 0); 73097#L21 assume !(~q <= 0); 73098#L22 assume !(~q > ~p); 72766#L23 call #t~ret1 := parts(~p - ~q, ~q);< 72791#$Ultimate##0 ~p := #in~p;~q := #in~q; 73101#L20 assume !(~p <= 0); 73102#L21 assume !(~q <= 0); 72989#L22 assume !(~q > ~p); 72990#L23 [2024-10-13 16:57:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 34537157, now seen corresponding path program 1 times [2024-10-13 16:57:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671158176] [2024-10-13 16:57:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:57:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:57:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:57:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:57:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:57:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:57:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 16:57:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:54,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671158176] [2024-10-13 16:57:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671158176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:54,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868214912] [2024-10-13 16:57:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:54,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:54,612 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:54,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-10-13 16:57:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 16:57:54,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 16:57:54,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868214912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:54,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:54,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-13 16:57:54,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373892373] [2024-10-13 16:57:54,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:54,870 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:54,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1614589677, now seen corresponding path program 3 times [2024-10-13 16:57:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960573716] [2024-10-13 16:57:54,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:54,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:54,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:55,094 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:55,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:55,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:55,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:55,094 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:55,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:55,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:55,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2024-10-13 16:57:55,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:55,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:55,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,156 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:55,156 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:55,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,159 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-13 16:57:55,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,176 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:55,177 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:55,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-13 16:57:55,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,188 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-13 16:57:55,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,201 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:55,201 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:55,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-13 16:57:55,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,213 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-13 16:57:55,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,225 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:55,225 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:55,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-13 16:57:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,237 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-13 16:57:55,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-13 16:57:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,270 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-13 16:57:55,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:55,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:58,755 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:58,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:58,762 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:58,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:58,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:58,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:58,762 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:58,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:58,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:58,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2024-10-13 16:57:58,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:58,762 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:58,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:58,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:58,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:58,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:58,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:58,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:58,829 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:58,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,831 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-13 16:57:58,835 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-13 16:57:58,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:58,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:58,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:58,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:58,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:58,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:58,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:58,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:58,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:58,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,859 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-13 16:57:58,860 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-13 16:57:58,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:58,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:58,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:58,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:58,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:58,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:58,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:58,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:58,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-13 16:57:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,883 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-13 16:57:58,885 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-13 16:57:58,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:58,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:58,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:58,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:58,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:58,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:58,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:58,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:58,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-10-13 16:57:58,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,908 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-13 16:57:58,909 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-13 16:57:58,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:58,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:58,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:58,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:58,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:58,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:58,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:58,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:58,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-13 16:57:58,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,932 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-13 16:57:58,933 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-13 16:57:58,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:58,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:58,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:58,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:58,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:58,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:58,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:58,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:58,950 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:58,950 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:58,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:58,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,951 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-13 16:57:58,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:58,953 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:58,953 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:58,953 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2024-10-13 16:57:58,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-13 16:57:58,963 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:57:59,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:57:59,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:59,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-13 16:57:59,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:59,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 17123 states and 28306 transitions. Complement of second has 56 states. [2024-10-13 16:57:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2024-10-13 16:57:59,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 70 letters. Loop has 15 letters. [2024-10-13 16:57:59,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:59,809 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:59,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:57:59,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:59,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:58:00,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:00,273 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-13 16:58:00,273 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:58:00,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 19433 states and 32559 transitions. Complement of second has 54 states. [2024-10-13 16:58:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:58:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2024-10-13 16:58:00,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 70 letters. Loop has 15 letters. [2024-10-13 16:58:00,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:00,673 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:00,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:58:00,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:58:01,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:01,119 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-13 16:58:01,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:58:01,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 39830 states and 67154 transitions. Complement of second has 381 states. [2024-10-13 16:58:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:58:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2024-10-13 16:58:01,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 70 letters. Loop has 15 letters. [2024-10-13 16:58:01,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:01,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 85 letters. Loop has 15 letters. [2024-10-13 16:58:01,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:01,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 70 letters. Loop has 30 letters. [2024-10-13 16:58:01,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:01,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39830 states and 67154 transitions. [2024-10-13 16:58:02,141 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 176 [2024-10-13 16:58:02,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39830 states to 15617 states and 27516 transitions. [2024-10-13 16:58:02,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2024-10-13 16:58:02,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 609 [2024-10-13 16:58:02,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 27516 transitions. [2024-10-13 16:58:02,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:02,536 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15617 states and 27516 transitions. [2024-10-13 16:58:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 27516 transitions. [2024-10-13 16:58:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 12095. [2024-10-13 16:58:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12095 states, 7471 states have (on average 1.224467942711819) internal successors, (9148), 8740 states have internal predecessors, (9148), 3359 states have call successors, (3511), 1553 states have call predecessors, (3511), 1265 states have return successors, (6387), 1801 states have call predecessors, (6387), 3312 states have call successors, (6387) [2024-10-13 16:58:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 19046 transitions. [2024-10-13 16:58:03,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12095 states and 19046 transitions. [2024-10-13 16:58:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 16:58:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 16:58:03,208 INFO L87 Difference]: Start difference. First operand 12095 states and 19046 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 12 states have internal predecessors, (42), 9 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 16:58:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:03,444 INFO L93 Difference]: Finished difference Result 10330 states and 15945 transitions. [2024-10-13 16:58:03,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10330 states and 15945 transitions. [2024-10-13 16:58:03,609 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 119 [2024-10-13 16:58:03,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10330 states to 10330 states and 15945 transitions. [2024-10-13 16:58:03,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2024-10-13 16:58:03,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2024-10-13 16:58:03,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10330 states and 15945 transitions. [2024-10-13 16:58:03,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:03,731 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10330 states and 15945 transitions. [2024-10-13 16:58:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10330 states and 15945 transitions. [2024-10-13 16:58:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10330 to 10303. [2024-10-13 16:58:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10303 states, 6358 states have (on average 1.2142183076439133) internal successors, (7720), 7443 states have internal predecessors, (7720), 2854 states have call successors, (2983), 1292 states have call predecessors, (2983), 1091 states have return successors, (5183), 1567 states have call predecessors, (5183), 2815 states have call successors, (5183) [2024-10-13 16:58:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10303 states to 10303 states and 15886 transitions. [2024-10-13 16:58:04,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10303 states and 15886 transitions. [2024-10-13 16:58:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 16:58:04,214 INFO L425 stractBuchiCegarLoop]: Abstraction has 10303 states and 15886 transitions. [2024-10-13 16:58:04,214 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-13 16:58:04,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10303 states and 15886 transitions. [2024-10-13 16:58:04,241 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 119 [2024-10-13 16:58:04,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:04,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:04,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 7, 7, 6, 6, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:04,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 16:58:04,244 INFO L745 eck$LassoCheckResult]: Stem: 177829#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 177784#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 177785#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 177782#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 177783#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 177839#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177888#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177889#$Ultimate##0 ~p := #in~p;~q := #in~q; 177891#L20 assume ~p <= 0;#res := 1; 177890#partsFINAL assume true; 177887#partsEXIT >#71#return; 177886#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177883#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177879#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177880#$Ultimate##0 ~p := #in~p;~q := #in~q; 177885#L20 assume ~p <= 0;#res := 1; 177882#partsFINAL assume true; 177878#partsEXIT >#71#return; 177861#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177860#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177855#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177858#$Ultimate##0 ~p := #in~p;~q := #in~q; 177854#L20 assume ~p <= 0;#res := 1; 177856#partsFINAL assume true; 177892#partsEXIT >#71#return; 177893#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178362#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 178358#L35-3 havoc main_~q~0#1; 177797#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 177798#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 177840#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177841#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178140#$Ultimate##0 ~p := #in~p;~q := #in~q; 178151#L20 assume !(~p <= 0); 178150#L21 assume ~q <= 0;#res := 0; 178148#partsFINAL assume true; 178139#partsEXIT >#71#return; 177834#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177835#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177788#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177789#$Ultimate##0 ~p := #in~p;~q := #in~q; 178165#L20 assume !(~p <= 0); 178163#L21 assume ~q <= 0;#res := 0; 178164#partsFINAL assume true; 178417#partsEXIT >#71#return; 178418#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178441#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 178071#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178073#$Ultimate##0 ~p := #in~p;~q := #in~q; 178827#L20 assume !(~p <= 0); 178825#L21 assume !(~q <= 0); 178824#L22 assume ~q > ~p; 177999#L22-1 call #t~ret0 := parts(~p, ~p);< 178821#$Ultimate##0 ~p := #in~p;~q := #in~q; 178822#L20 assume !(~p <= 0); 180353#L21 assume !(~q <= 0); 180340#L22 assume !(~q > ~p); 180333#L23 call #t~ret1 := parts(~p - ~q, ~q);< 180339#$Ultimate##0 ~p := #in~p;~q := #in~q; 180378#L20 assume ~p <= 0;#res := 1; 180376#partsFINAL assume true; 180332#partsEXIT >#67#return; 179648#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 179649#$Ultimate##0 ~p := #in~p;~q := #in~q; 180298#L20 assume !(~p <= 0); 180297#L21 assume ~q <= 0;#res := 0; 180296#partsFINAL assume true; 179647#partsEXIT >#69#return; 178023#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 179646#partsFINAL assume true; 177994#partsEXIT >#65#return; 178006#L22-2 #res := #t~ret0;havoc #t~ret0; 178219#partsFINAL assume true; 178070#partsEXIT >#71#return; 178057#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178056#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177850#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178054#$Ultimate##0 ~p := #in~p;~q := #in~q; 177985#L20 assume !(~p <= 0); 177975#L21 assume !(~q <= 0); 177922#L22 assume ~q > ~p; 177864#L22-1 call #t~ret0 := parts(~p, ~p);< 177917#$Ultimate##0 [2024-10-13 16:58:04,244 INFO L747 eck$LassoCheckResult]: Loop: 177917#$Ultimate##0 ~p := #in~p;~q := #in~q; 177915#L20 assume !(~p <= 0); 177913#L21 assume !(~q <= 0); 177909#L22 assume ~q > ~p; 177870#L22-1 call #t~ret0 := parts(~p, ~p);< 177917#$Ultimate##0 [2024-10-13 16:58:04,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -9765940, now seen corresponding path program 1 times [2024-10-13 16:58:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988218806] [2024-10-13 16:58:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:58:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:58:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 16:58:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-13 16:58:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988218806] [2024-10-13 16:58:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988218806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934371543] [2024-10-13 16:58:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:04,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,392 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-10-13 16:58:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:04,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 16:58:04,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-13 16:58:04,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:58:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934371543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:04,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 16:58:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-10-13 16:58:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186063593] [2024-10-13 16:58:04,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:04,543 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 28756408, now seen corresponding path program 2 times [2024-10-13 16:58:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513400917] [2024-10-13 16:58:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:04,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:04,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:04,600 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:04,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:04,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:04,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:04,600 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:04,601 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,601 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:04,601 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:04,601 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2024-10-13 16:58:04,601 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:04,601 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:04,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,646 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:04,646 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,648 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-13 16:58:04,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:04,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:04,660 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:04,660 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:04,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-10-13 16:58:04,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,671 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-13 16:58:04,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:04,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:04,683 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:04,683 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:04,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-10-13 16:58:04,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,694 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-13 16:58:04,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:04,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:04,707 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:04,707 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:04,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-13 16:58:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,718 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-13 16:58:04,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:04,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:04,730 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:04,730 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:04,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-13 16:58:04,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,741 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-13 16:58:04,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:04,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:04,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-13 16:58:04,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,772 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-13 16:58:04,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:04,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:04,811 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:04,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:04,815 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:04,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:04,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:04,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:04,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:04,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:04,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:04,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2024-10-13 16:58:04,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:04,815 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:04,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:04,856 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:04,856 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:04,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,857 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-13 16:58:04,858 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-13 16:58:04,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:04,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:04,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:04,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:04,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:04,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:04,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:04,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:04,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-13 16:58:04,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,881 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-13 16:58:04,882 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-13 16:58:04,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:04,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:04,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:04,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:04,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:04,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:04,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:04,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:04,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-13 16:58:04,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,905 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-13 16:58:04,906 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-13 16:58:04,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:04,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:04,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:04,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:04,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:04,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:04,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:04,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:04,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-13 16:58:04,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,928 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-13 16:58:04,929 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-13 16:58:04,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:04,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:04,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:04,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:04,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:04,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:04,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:04,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:04,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-13 16:58:04,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,952 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-13 16:58:04,953 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-13 16:58:04,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:04,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:04,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:04,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:04,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:04,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:04,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:04,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:04,969 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:04,970 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:58:04,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,972 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-13 16:58:04,974 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:04,974 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:04,974 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:04,974 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-10-13 16:58:04,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-13 16:58:04,986 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:04,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:05,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:05,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:05,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:05,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:58:05,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:05,441 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-13 16:58:05,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:58:05,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809 Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:58:05,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 15816 states and 22568 transitions. Complement of second has 42 states. [2024-10-13 16:58:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:58:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-10-13 16:58:05,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 82 letters. Loop has 5 letters. [2024-10-13 16:58:05,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:05,615 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:05,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:05,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:05,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:06,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:58:06,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:06,068 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-13 16:58:06,068 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:58:06,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809 Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:58:06,190 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 15816 states and 22568 transitions. Complement of second has 42 states. [2024-10-13 16:58:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:58:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-10-13 16:58:06,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 82 letters. Loop has 5 letters. [2024-10-13 16:58:06,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:06,191 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:06,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:06,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:06,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:06,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:58:06,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:06,595 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-13 16:58:06,596 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 16:58:06,596 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809 Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:58:06,824 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 21413 states and 31115 transitions. Complement of second has 43 states. [2024-10-13 16:58:06,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:58:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2024-10-13 16:58:06,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 82 letters. Loop has 5 letters. [2024-10-13 16:58:06,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:06,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 87 letters. Loop has 5 letters. [2024-10-13 16:58:06,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:06,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 82 letters. Loop has 10 letters. [2024-10-13 16:58:06,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:06,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21413 states and 31115 transitions. [2024-10-13 16:58:06,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2024-10-13 16:58:07,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21413 states to 11927 states and 19027 transitions. [2024-10-13 16:58:07,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2024-10-13 16:58:07,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2024-10-13 16:58:07,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11927 states and 19027 transitions. [2024-10-13 16:58:07,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:07,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11927 states and 19027 transitions. [2024-10-13 16:58:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11927 states and 19027 transitions. [2024-10-13 16:58:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11927 to 7997. [2024-10-13 16:58:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7997 states, 4994 states have (on average 1.21005206247497) internal successors, (6043), 5713 states have internal predecessors, (6043), 2108 states have call successors, (2201), 1006 states have call predecessors, (2201), 895 states have return successors, (3780), 1277 states have call predecessors, (3780), 2096 states have call successors, (3780) [2024-10-13 16:58:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 12024 transitions. [2024-10-13 16:58:07,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7997 states and 12024 transitions. [2024-10-13 16:58:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:58:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 16:58:07,482 INFO L87 Difference]: Start difference. First operand 7997 states and 12024 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 16:58:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:07,566 INFO L93 Difference]: Finished difference Result 4190 states and 6496 transitions. [2024-10-13 16:58:07,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4190 states and 6496 transitions. [2024-10-13 16:58:07,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-13 16:58:07,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4190 states to 4106 states and 6348 transitions. [2024-10-13 16:58:07,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2024-10-13 16:58:07,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2024-10-13 16:58:07,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4106 states and 6348 transitions. [2024-10-13 16:58:07,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:07,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4106 states and 6348 transitions. [2024-10-13 16:58:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states and 6348 transitions. [2024-10-13 16:58:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4045. [2024-10-13 16:58:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4045 states, 2527 states have (on average 1.216462208151959) internal successors, (3074), 2888 states have internal predecessors, (3074), 1061 states have call successors, (1117), 524 states have call predecessors, (1117), 457 states have return successors, (1948), 632 states have call predecessors, (1948), 1060 states have call successors, (1948) [2024-10-13 16:58:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 6139 transitions. [2024-10-13 16:58:07,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4045 states and 6139 transitions. [2024-10-13 16:58:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:58:07,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 4045 states and 6139 transitions. [2024-10-13 16:58:07,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-13 16:58:07,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4045 states and 6139 transitions. [2024-10-13 16:58:07,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-13 16:58:07,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:07,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:07,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:07,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:07,728 INFO L745 eck$LassoCheckResult]: Stem: 254641#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 254606#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 254607#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 254599#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 254600#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254657#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254694#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254695#$Ultimate##0 ~p := #in~p;~q := #in~q; 254697#L20 assume ~p <= 0;#res := 1; 254696#partsFINAL assume true; 254693#partsEXIT >#71#return; 254692#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254690#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254687#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254688#$Ultimate##0 ~p := #in~p;~q := #in~q; 254699#L20 assume ~p <= 0;#res := 1; 254698#partsFINAL assume true; 254686#partsEXIT >#71#return; 254684#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254683#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254677#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254681#$Ultimate##0 ~p := #in~p;~q := #in~q; 254676#L20 assume ~p <= 0;#res := 1; 254678#partsFINAL assume true; 254717#partsEXIT >#71#return; 254718#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254793#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 254617#L35-3 havoc main_~q~0#1; 254618#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 254787#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254785#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254601#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254602#$Ultimate##0 ~p := #in~p;~q := #in~q; 254792#L20 assume !(~p <= 0); 254791#L21 assume ~q <= 0;#res := 0; 254790#partsFINAL assume true; 254661#partsEXIT >#71#return; 254662#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254761#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254727#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254730#$Ultimate##0 ~p := #in~p;~q := #in~q; 254837#L20 assume !(~p <= 0); 254831#L21 assume !(~q <= 0); 254827#L22 assume !(~q > ~p); 254828#L23 call #t~ret1 := parts(~p - ~q, ~q);< 255056#$Ultimate##0 ~p := #in~p;~q := #in~q; 255065#L20 assume ~p <= 0;#res := 1; 255063#partsFINAL assume true; 255055#partsEXIT >#67#return; 255038#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 255039#$Ultimate##0 ~p := #in~p;~q := #in~q; 255061#L20 assume !(~p <= 0); 255051#L21 assume ~q <= 0;#res := 0; 255050#partsFINAL assume true; 255037#partsEXIT >#69#return; 255025#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 255018#partsFINAL assume true; 254726#partsEXIT >#71#return; 254728#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 256610#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254664#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254604#$Ultimate##0 ~p := #in~p;~q := #in~q; 255817#L20 assume !(~p <= 0); 254721#L21 assume !(~q <= 0); 254722#L22 assume ~q > ~p; 254712#L22-1 call #t~ret0 := parts(~p, ~p);< 254810#$Ultimate##0 ~p := #in~p;~q := #in~q; 256842#L20 assume !(~p <= 0); 257047#L21 assume !(~q <= 0); 257045#L22 assume !(~q > ~p); 257024#L23 call #t~ret1 := parts(~p - ~q, ~q);< 257027#$Ultimate##0 ~p := #in~p;~q := #in~q; 257359#L20 assume ~p <= 0;#res := 1; 257245#partsFINAL assume true; 257179#partsEXIT >#67#return; 257146#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 257159#$Ultimate##0 ~p := #in~p;~q := #in~q; 257381#L20 assume !(~p <= 0); 257375#L21 assume ~q <= 0;#res := 0; 257373#partsFINAL assume true; 257145#partsEXIT >#69#return; 257144#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 256613#partsFINAL assume true; 254700#partsEXIT >#65#return; 254679#L22-2 #res := #t~ret0;havoc #t~ret0; 254680#partsFINAL assume true; 254663#partsEXIT >#71#return; 254660#L36-1 [2024-10-13 16:58:07,729 INFO L747 eck$LassoCheckResult]: Loop: 254660#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254645#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 254646#L35-3 havoc main_~q~0#1; 254612#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 254613#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254658#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254659#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254672#$Ultimate##0 ~p := #in~p;~q := #in~q; 254671#L20 assume !(~p <= 0); 254670#L21 assume ~q <= 0;#res := 0; 254668#partsFINAL assume true; 254669#partsEXIT >#71#return; 254651#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254652#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254731#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254748#$Ultimate##0 ~p := #in~p;~q := #in~q; 254783#L20 assume !(~p <= 0); 254782#L21 assume !(~q <= 0); 254779#L22 assume !(~q > ~p); 254776#L23 call #t~ret1 := parts(~p - ~q, ~q);< 254777#$Ultimate##0 ~p := #in~p;~q := #in~q; 254786#L20 assume ~p <= 0;#res := 1; 254784#partsFINAL assume true; 254775#partsEXIT >#67#return; 254757#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 254758#$Ultimate##0 ~p := #in~p;~q := #in~q; 254781#L20 assume !(~p <= 0); 254778#L21 assume ~q <= 0;#res := 0; 254762#partsFINAL assume true; 254755#partsEXIT >#69#return; 254753#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 254751#partsFINAL assume true; 254750#partsEXIT >#71#return; 254740#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254738#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254674#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254735#$Ultimate##0 ~p := #in~p;~q := #in~q; 254815#L20 assume !(~p <= 0); 254814#L21 assume !(~q <= 0); 254811#L22 assume ~q > ~p; 254703#L22-1 call #t~ret0 := parts(~p, ~p);< 254716#$Ultimate##0 ~p := #in~p;~q := #in~q; 256852#L20 assume !(~p <= 0); 257009#L21 assume !(~q <= 0); 257006#L22 assume !(~q > ~p); 256996#L23 call #t~ret1 := parts(~p - ~q, ~q);< 256999#$Ultimate##0 ~p := #in~p;~q := #in~q; 257216#L20 assume ~p <= 0;#res := 1; 257215#partsFINAL assume true; 257178#partsEXIT >#67#return; 257146#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 257159#$Ultimate##0 ~p := #in~p;~q := #in~q; 257381#L20 assume !(~p <= 0); 257375#L21 assume ~q <= 0;#res := 0; 257373#partsFINAL assume true; 257145#partsEXIT >#69#return; 257144#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 256613#partsFINAL assume true; 254700#partsEXIT >#65#return; 254714#L22-2 #res := #t~ret0;havoc #t~ret0; 254673#partsFINAL assume true; 254675#partsEXIT >#71#return; 254660#L36-1 [2024-10-13 16:58:07,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 2 times [2024-10-13 16:58:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193616760] [2024-10-13 16:58:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:07,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:07,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:07,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash -96725577, now seen corresponding path program 1 times [2024-10-13 16:58:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769380521] [2024-10-13 16:58:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:07,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:07,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1897649466, now seen corresponding path program 3 times [2024-10-13 16:58:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031821359] [2024-10-13 16:58:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:58:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:58:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 16:58:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 16:58:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 16:58:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 16:58:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 154 proven. 76 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-10-13 16:58:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031821359] [2024-10-13 16:58:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031821359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310368487] [2024-10-13 16:58:08,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:08,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:08,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:08,122 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:08,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-10-13 16:58:08,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-13 16:58:08,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:08,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 16:58:08,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 474 proven. 32 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-10-13 16:58:08,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 185 proven. 86 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2024-10-13 16:58:08,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310368487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:08,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:08,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2024-10-13 16:58:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476235545] [2024-10-13 16:58:08,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:09,054 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:09,054 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:09,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:09,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:09,054 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:09,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:09,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:09,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2024-10-13 16:58:09,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:09,054 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:09,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,092 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:09,092 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:09,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,093 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-13 16:58:09,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:09,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:09,113 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:09,114 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Honda state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:09,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-10-13 16:58:09,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,125 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-13 16:58:09,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:09,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:09,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-13 16:58:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,149 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-13 16:58:09,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:09,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:09,163 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:09,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-10-13 16:58:09,174 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:09,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:09,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:09,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:09,175 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:09,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:09,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:09,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2024-10-13 16:58:09,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:09,175 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:09,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,219 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:09,220 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:09,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,221 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-13 16:58:09,223 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-13 16:58:09,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:09,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:09,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:09,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:09,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:09,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:09,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:09,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:09,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-13 16:58:09,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,246 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-13 16:58:09,247 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-13 16:58:09,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:09,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:09,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:09,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:09,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:09,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:09,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:09,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:09,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-13 16:58:09,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,270 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-13 16:58:09,272 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-13 16:58:09,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:09,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:09,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:09,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:09,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:09,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:09,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:09,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:09,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-13 16:58:09,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,294 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-13 16:58:09,295 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-13 16:58:09,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:09,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:09,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:09,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:09,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:09,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:09,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:09,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:09,309 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:09,309 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,310 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-13 16:58:09,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:09,312 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:09,312 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:09,312 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2024-10-13 16:58:09,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-10-13 16:58:09,322 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:09,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:09,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:09,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:09,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:09,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 16:58:09,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 16:58:10,034 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-13 16:58:10,034 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4045 states and 6139 transitions. cyclomatic complexity: 2186 Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-13 16:58:10,337 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4045 states and 6139 transitions. cyclomatic complexity: 2186. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Result 9389 states and 14758 transitions. Complement of second has 71 states. [2024-10-13 16:58:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-13 16:58:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2024-10-13 16:58:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 87 letters. Loop has 62 letters. [2024-10-13 16:58:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 149 letters. Loop has 62 letters. [2024-10-13 16:58:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 87 letters. Loop has 124 letters. [2024-10-13 16:58:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:10,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9389 states and 14758 transitions. [2024-10-13 16:58:10,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-10-13 16:58:10,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9389 states to 9336 states and 14686 transitions. [2024-10-13 16:58:10,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2024-10-13 16:58:10,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2024-10-13 16:58:10,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9336 states and 14686 transitions. [2024-10-13 16:58:10,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:10,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9336 states and 14686 transitions. [2024-10-13 16:58:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states and 14686 transitions. [2024-10-13 16:58:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 8436. [2024-10-13 16:58:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8436 states, 5176 states have (on average 1.2078825347758888) internal successors, (6252), 5956 states have internal predecessors, (6252), 2295 states have call successors, (2405), 1072 states have call predecessors, (2405), 965 states have return successors, (3541), 1407 states have call predecessors, (3541), 2292 states have call successors, (3541) [2024-10-13 16:58:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 12198 transitions. [2024-10-13 16:58:10,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8436 states and 12198 transitions. [2024-10-13 16:58:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 16:58:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-13 16:58:10,644 INFO L87 Difference]: Start difference. First operand 8436 states and 12198 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 14 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (22), 9 states have call predecessors, (22), 14 states have call successors, (22) [2024-10-13 16:58:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:11,083 INFO L93 Difference]: Finished difference Result 7265 states and 10824 transitions. [2024-10-13 16:58:11,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7265 states and 10824 transitions. [2024-10-13 16:58:11,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-10-13 16:58:11,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7265 states to 3744 states and 5610 transitions. [2024-10-13 16:58:11,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2024-10-13 16:58:11,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2024-10-13 16:58:11,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3744 states and 5610 transitions. [2024-10-13 16:58:11,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:11,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3744 states and 5610 transitions. [2024-10-13 16:58:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states and 5610 transitions. [2024-10-13 16:58:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3499. [2024-10-13 16:58:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 2147 states have (on average 1.1974848625989754) internal successors, (2571), 2445 states have internal predecessors, (2571), 939 states have call successors, (980), 440 states have call predecessors, (980), 413 states have return successors, (1449), 613 states have call predecessors, (1449), 936 states have call successors, (1449) [2024-10-13 16:58:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5000 transitions. [2024-10-13 16:58:11,248 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3499 states and 5000 transitions. [2024-10-13 16:58:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 16:58:11,249 INFO L425 stractBuchiCegarLoop]: Abstraction has 3499 states and 5000 transitions. [2024-10-13 16:58:11,249 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-13 16:58:11,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3499 states and 5000 transitions. [2024-10-13 16:58:11,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2024-10-13 16:58:11,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:11,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:11,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:11,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 13, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:11,265 INFO L745 eck$LassoCheckResult]: Stem: 285458#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 285401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 285402#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 285394#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 285395#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285502#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285499#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285500#$Ultimate##0 ~p := #in~p;~q := #in~q; 285503#L20 assume ~p <= 0;#res := 1; 285501#partsFINAL assume true; 285498#partsEXIT >#71#return; 285496#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285493#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285488#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285490#$Ultimate##0 ~p := #in~p;~q := #in~q; 285494#L20 assume ~p <= 0;#res := 1; 285491#partsFINAL assume true; 285487#partsEXIT >#71#return; 285486#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285484#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285480#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285481#$Ultimate##0 ~p := #in~p;~q := #in~q; 285485#L20 assume ~p <= 0;#res := 1; 285483#partsFINAL assume true; 285479#partsEXIT >#71#return; 285478#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285477#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 285424#L35-3 havoc main_~q~0#1; 285414#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285415#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285476#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285946#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285947#$Ultimate##0 ~p := #in~p;~q := #in~q; 285956#L20 assume !(~p <= 0); 285953#L21 assume ~q <= 0;#res := 0; 285952#partsFINAL assume true; 285945#partsEXIT >#71#return; 285941#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285939#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285936#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285937#$Ultimate##0 ~p := #in~p;~q := #in~q; 285961#L20 assume !(~p <= 0); 285960#L21 assume !(~q <= 0); 285959#L22 assume !(~q > ~p); 285950#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285951#$Ultimate##0 ~p := #in~p;~q := #in~q; 285958#L20 assume ~p <= 0;#res := 1; 285955#partsFINAL assume true; 285949#partsEXIT >#67#return; 285943#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285944#$Ultimate##0 ~p := #in~p;~q := #in~q; 285957#L20 assume !(~p <= 0); 285954#L21 assume ~q <= 0;#res := 0; 285948#partsFINAL assume true; 285942#partsEXIT >#69#return; 285940#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285938#partsFINAL assume true; 285935#partsEXIT >#71#return; 285934#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285933#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285559#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285930#$Ultimate##0 ~p := #in~p;~q := #in~q; 285929#L20 assume !(~p <= 0); 285928#L21 assume !(~q <= 0); 285926#L22 assume ~q > ~p; 285549#L22-1 call #t~ret0 := parts(~p, ~p);< 285560#$Ultimate##0 ~p := #in~p;~q := #in~q; 285925#L20 assume !(~p <= 0); 286219#L21 assume !(~q <= 0); 286218#L22 assume !(~q > ~p); 285573#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285574#$Ultimate##0 ~p := #in~p;~q := #in~q; 285591#L20 assume ~p <= 0;#res := 1; 285592#partsFINAL assume true; 285572#partsEXIT >#67#return; 285565#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285568#$Ultimate##0 ~p := #in~p;~q := #in~q; 285578#L20 assume !(~p <= 0); 285577#L21 assume ~q <= 0;#res := 0; 285571#partsFINAL assume true; 285564#partsEXIT >#69#return; 285563#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285561#partsFINAL assume true; 285538#partsEXIT >#65#return; 285555#L22-2 #res := #t~ret0;havoc #t~ret0; 285993#partsFINAL assume true; 285991#partsEXIT >#71#return; 285506#L36-1 [2024-10-13 16:58:11,266 INFO L747 eck$LassoCheckResult]: Loop: 285506#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285465#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 285422#L35-3 havoc main_~q~0#1; 285423#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285619#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285504#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285505#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285615#$Ultimate##0 ~p := #in~p;~q := #in~q; 285626#L20 assume !(~p <= 0); 285625#L21 assume ~q <= 0;#res := 0; 285509#partsFINAL assume true; 285510#partsEXIT >#71#return; 285470#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285471#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285963#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285970#$Ultimate##0 ~p := #in~p;~q := #in~q; 285989#L20 assume !(~p <= 0); 285988#L21 assume !(~q <= 0); 285987#L22 assume !(~q > ~p); 285985#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285986#$Ultimate##0 ~p := #in~p;~q := #in~q; 286068#L20 assume !(~p <= 0); 286067#L21 assume !(~q <= 0); 286066#L22 assume !(~q > ~p); 286064#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286065#$Ultimate##0 ~p := #in~p;~q := #in~q; 286087#L20 assume ~p <= 0;#res := 1; 286086#partsFINAL assume true; 286062#partsEXIT >#67#return; 286046#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286048#$Ultimate##0 ~p := #in~p;~q := #in~q; 286053#L20 assume !(~p <= 0); 286052#L21 assume ~q <= 0;#res := 0; 286049#partsFINAL assume true; 286044#partsEXIT >#69#return; 286033#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286031#partsFINAL assume true; 285984#partsEXIT >#67#return; 285982#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285983#$Ultimate##0 ~p := #in~p;~q := #in~q; 286106#L20 assume !(~p <= 0); 286103#L21 assume ~q <= 0;#res := 0; 286099#partsFINAL assume true; 285981#partsEXIT >#69#return; 285980#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285977#partsFINAL assume true; 285968#partsEXIT >#71#return; 285964#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285965#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285398#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285400#$Ultimate##0 ~p := #in~p;~q := #in~q; 286061#L20 assume !(~p <= 0); 286060#L21 assume !(~q <= 0); 286058#L22 assume !(~q > ~p); 286059#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287104#$Ultimate##0 ~p := #in~p;~q := #in~q; 287109#L20 assume ~p <= 0;#res := 1; 287108#partsFINAL assume true; 287107#partsEXIT >#67#return; 286025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287043#$Ultimate##0 ~p := #in~p;~q := #in~q; 287123#L20 assume !(~p <= 0); 287120#L21 assume !(~q <= 0); 287117#L22 assume !(~q > ~p); 287021#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287023#$Ultimate##0 ~p := #in~p;~q := #in~q; 288148#L20 assume !(~p <= 0); 288149#L21 assume !(~q <= 0); 288803#L22 assume !(~q > ~p); 288442#L23 call #t~ret1 := parts(~p - ~q, ~q);< 288789#$Ultimate##0 ~p := #in~p;~q := #in~q; 288863#L20 assume ~p <= 0;#res := 1; 288862#partsFINAL assume true; 288439#partsEXIT >#67#return; 285430#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287576#$Ultimate##0 ~p := #in~p;~q := #in~q; 285474#L20 assume !(~p <= 0); 285428#L21 assume ~q <= 0;#res := 0; 285432#partsFINAL assume true; 288870#partsEXIT >#69#return; 287569#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287551#partsFINAL assume true; 287018#partsEXIT >#67#return; 287012#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287016#$Ultimate##0 ~p := #in~p;~q := #in~q; 287045#L20 assume !(~p <= 0); 287044#L21 assume ~q <= 0;#res := 0; 287017#partsFINAL assume true; 287010#partsEXIT >#69#return; 286038#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287159#partsFINAL assume true; 287015#partsEXIT >#69#return; 286625#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286609#partsFINAL assume true; 285973#partsEXIT >#71#return; 285972#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285971#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285515#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285399#$Ultimate##0 ~p := #in~p;~q := #in~q; 286005#L20 assume !(~p <= 0); 286002#L21 assume !(~q <= 0); 285997#L22 assume ~q > ~p; 285543#L22-1 call #t~ret0 := parts(~p, ~p);< 285597#$Ultimate##0 ~p := #in~p;~q := #in~q; 285593#L20 assume !(~p <= 0); 285589#L21 assume !(~q <= 0); 285579#L22 assume !(~q > ~p); 285580#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286206#$Ultimate##0 ~p := #in~p;~q := #in~q; 286228#L20 assume ~p <= 0;#res := 1; 285587#partsFINAL assume true; 285588#partsEXIT >#67#return; 285565#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285568#$Ultimate##0 ~p := #in~p;~q := #in~q; 285578#L20 assume !(~p <= 0); 285577#L21 assume ~q <= 0;#res := 0; 285571#partsFINAL assume true; 285564#partsEXIT >#69#return; 285563#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285561#partsFINAL assume true; 285538#partsEXIT >#65#return; 285524#L22-2 #res := #t~ret0;havoc #t~ret0; 285525#partsFINAL assume true; 285514#partsEXIT >#71#return; 285506#L36-1 [2024-10-13 16:58:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 4 times [2024-10-13 16:58:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:11,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461948246] [2024-10-13 16:58:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:11,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:11,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1727491368, now seen corresponding path program 2 times [2024-10-13 16:58:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96593225] [2024-10-13 16:58:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 16:58:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 16:58:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 16:58:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 190 proven. 134 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-10-13 16:58:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96593225] [2024-10-13 16:58:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96593225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33151251] [2024-10-13 16:58:11,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:11,784 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:11,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2024-10-13 16:58:11,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:11,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:11,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 16:58:11,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 181 proven. 144 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-13 16:58:11,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 181 proven. 147 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-13 16:58:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33151251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:12,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 13] total 26 [2024-10-13 16:58:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969635723] [2024-10-13 16:58:12,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:12,454 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 16:58:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-10-13 16:58:12,455 INFO L87 Difference]: Start difference. First operand 3499 states and 5000 transitions. cyclomatic complexity: 1581 Second operand has 27 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (24), 13 states have call predecessors, (24), 15 states have call successors, (24) [2024-10-13 16:58:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:13,550 INFO L93 Difference]: Finished difference Result 5195 states and 8619 transitions. [2024-10-13 16:58:13,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5195 states and 8619 transitions. [2024-10-13 16:58:13,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2024-10-13 16:58:13,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5195 states to 5070 states and 8338 transitions. [2024-10-13 16:58:13,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 686 [2024-10-13 16:58:13,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 686 [2024-10-13 16:58:13,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5070 states and 8338 transitions. [2024-10-13 16:58:13,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:13,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5070 states and 8338 transitions. [2024-10-13 16:58:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states and 8338 transitions. [2024-10-13 16:58:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 4161. [2024-10-13 16:58:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 2582 states have (on average 1.1707978311386522) internal successors, (3023), 2869 states have internal predecessors, (3023), 1018 states have call successors, (1064), 467 states have call predecessors, (1064), 561 states have return successors, (2160), 824 states have call predecessors, (2160), 1008 states have call successors, (2160) [2024-10-13 16:58:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 6247 transitions. [2024-10-13 16:58:13,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4161 states and 6247 transitions. [2024-10-13 16:58:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 16:58:13,736 INFO L425 stractBuchiCegarLoop]: Abstraction has 4161 states and 6247 transitions. [2024-10-13 16:58:13,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-13 16:58:13,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4161 states and 6247 transitions. [2024-10-13 16:58:13,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2024-10-13 16:58:13,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:13,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:13,750 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 7, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:13,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [39, 39, 28, 19, 16, 16, 16, 16, 16, 16, 11, 9, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2024-10-13 16:58:13,751 INFO L745 eck$LassoCheckResult]: Stem: 295202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 295149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 295150#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 295147#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 295148#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 295241#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295238#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295239#$Ultimate##0 ~p := #in~p;~q := #in~q; 295242#L20 assume ~p <= 0;#res := 1; 295240#partsFINAL assume true; 295237#partsEXIT >#71#return; 295235#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295232#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295227#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295229#$Ultimate##0 ~p := #in~p;~q := #in~q; 295233#L20 assume ~p <= 0;#res := 1; 295230#partsFINAL assume true; 295226#partsEXIT >#71#return; 295225#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295223#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295219#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295220#$Ultimate##0 ~p := #in~p;~q := #in~q; 295224#L20 assume ~p <= 0;#res := 1; 295222#partsFINAL assume true; 295218#partsEXIT >#71#return; 295217#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295216#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 295169#L35-3 havoc main_~q~0#1; 295166#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 295167#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 295215#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295279#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295391#$Ultimate##0 ~p := #in~p;~q := #in~q; 295390#L20 assume !(~p <= 0); 295388#L21 assume ~q <= 0;#res := 0; 295389#partsFINAL assume true; 295278#partsEXIT >#71#return; 295207#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295208#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295153#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295154#$Ultimate##0 ~p := #in~p;~q := #in~q; 295955#L20 assume !(~p <= 0); 295954#L21 assume !(~q <= 0); 295950#L22 assume !(~q > ~p); 295944#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295945#$Ultimate##0 ~p := #in~p;~q := #in~q; 295953#L20 assume ~p <= 0;#res := 1; 295949#partsFINAL assume true; 295943#partsEXIT >#67#return; 295940#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295941#$Ultimate##0 ~p := #in~p;~q := #in~q; 295952#L20 assume !(~p <= 0); 295948#L21 assume ~q <= 0;#res := 0; 295942#partsFINAL assume true; 295939#partsEXIT >#69#return; 295937#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295933#partsFINAL assume true; 295930#partsEXIT >#71#return; 295931#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295914#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295247#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 296804#$Ultimate##0 ~p := #in~p;~q := #in~q; 296805#L20 assume !(~p <= 0); 296800#L21 assume !(~q <= 0); 296801#L22 assume ~q > ~p; 295336#L22-1 call #t~ret0 := parts(~p, ~p);< 296789#$Ultimate##0 ~p := #in~p;~q := #in~q; 297301#L20 assume !(~p <= 0); 297548#L21 assume !(~q <= 0); 297546#L22 assume !(~q > ~p); 295184#L23 call #t~ret1 := parts(~p - ~q, ~q);< 297543#$Ultimate##0 ~p := #in~p;~q := #in~q; 297547#L20 assume ~p <= 0;#res := 1; 297545#partsFINAL assume true; 297542#partsEXIT >#67#return; 297257#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299224#$Ultimate##0 ~p := #in~p;~q := #in~q; 297424#L20 assume !(~p <= 0); 297425#L21 assume !(~q <= 0); 297403#L22 assume !(~q > ~p); 297341#L23 call #t~ret1 := parts(~p - ~q, ~q);< 297344#$Ultimate##0 ~p := #in~p;~q := #in~q; 297355#L20 assume ~p <= 0;#res := 1; 297346#partsFINAL assume true; 297339#partsEXIT >#67#return; 295177#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295144#$Ultimate##0 ~p := #in~p;~q := #in~q; 298803#L20 assume !(~p <= 0); 295175#L21 assume ~q <= 0;#res := 0; 295178#partsFINAL assume true; 299229#partsEXIT >#69#return; 299228#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299227#partsFINAL assume true; 299220#partsEXIT >#69#return; 299218#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299216#partsFINAL assume true; 296787#partsEXIT >#65#return; 295261#L22-2 #res := #t~ret0;havoc #t~ret0; 295256#partsFINAL assume true; 295246#partsEXIT >#71#return; 295244#L36-1 [2024-10-13 16:58:13,752 INFO L747 eck$LassoCheckResult]: Loop: 295244#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295243#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 295168#L35-3 havoc main_~q~0#1; 295164#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 295165#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 295203#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295151#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295152#$Ultimate##0 ~p := #in~p;~q := #in~q; 295254#L20 assume !(~p <= 0); 295253#L21 assume ~q <= 0;#res := 0; 295252#partsFINAL assume true; 295245#partsEXIT >#71#return; 295206#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295204#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295205#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295288#$Ultimate##0 ~p := #in~p;~q := #in~q; 295373#L20 assume !(~p <= 0); 295372#L21 assume !(~q <= 0); 295328#L22 assume !(~q > ~p); 295326#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295327#$Ultimate##0 ~p := #in~p;~q := #in~q; 295421#L20 assume !(~p <= 0); 295420#L21 assume !(~q <= 0); 295419#L22 assume !(~q > ~p); 295411#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295427#$Ultimate##0 ~p := #in~p;~q := #in~q; 295426#L20 assume !(~p <= 0); 295425#L21 assume !(~q <= 0); 295424#L22 assume !(~q > ~p); 295412#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295427#$Ultimate##0 ~p := #in~p;~q := #in~q; 295426#L20 assume !(~p <= 0); 295425#L21 assume !(~q <= 0); 295424#L22 assume !(~q > ~p); 295423#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295418#$Ultimate##0 ~p := #in~p;~q := #in~q; 295451#L20 assume ~p <= 0;#res := 1; 295450#partsFINAL assume true; 295449#partsEXIT >#67#return; 295406#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295409#$Ultimate##0 ~p := #in~p;~q := #in~q; 295414#L20 assume !(~p <= 0); 295413#L21 assume ~q <= 0;#res := 0; 295410#partsFINAL assume true; 295405#partsEXIT >#69#return; 295408#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295457#partsFINAL assume true; 295416#partsEXIT >#67#return; 295406#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295409#$Ultimate##0 ~p := #in~p;~q := #in~q; 295414#L20 assume !(~p <= 0); 295413#L21 assume ~q <= 0;#res := 0; 295410#partsFINAL assume true; 295405#partsEXIT >#69#return; 295408#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295457#partsFINAL assume true; 295416#partsEXIT >#67#return; 295407#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295409#$Ultimate##0 ~p := #in~p;~q := #in~q; 295414#L20 assume !(~p <= 0); 295413#L21 assume ~q <= 0;#res := 0; 295410#partsFINAL assume true; 295405#partsEXIT >#69#return; 295386#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295374#partsFINAL assume true; 295325#partsEXIT >#67#return; 295312#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295313#$Ultimate##0 ~p := #in~p;~q := #in~q; 295316#L20 assume !(~p <= 0); 295315#L21 assume ~q <= 0;#res := 0; 295314#partsFINAL assume true; 295311#partsEXIT >#69#return; 295309#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295292#partsFINAL assume true; 295287#partsEXIT >#71#return; 295277#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295284#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295275#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295281#$Ultimate##0 ~p := #in~p;~q := #in~q; 295385#L20 assume !(~p <= 0); 295384#L21 assume !(~q <= 0); 295381#L22 assume ~q > ~p; 295382#L22-1 call #t~ret0 := parts(~p, ~p);< 295471#$Ultimate##0 ~p := #in~p;~q := #in~q; 295882#L20 assume !(~p <= 0); 296045#L21 assume !(~q <= 0); 296044#L22 assume !(~q > ~p); 295840#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295844#$Ultimate##0 ~p := #in~p;~q := #in~q; 296576#L20 assume ~p <= 0;#res := 1; 296574#partsFINAL assume true; 296570#partsEXIT >#67#return; 295479#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295613#$Ultimate##0 ~p := #in~p;~q := #in~q; 295881#L20 assume !(~p <= 0); 295877#L21 assume !(~q <= 0); 295870#L22 assume !(~q > ~p); 295872#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295888#$Ultimate##0 ~p := #in~p;~q := #in~q; 295934#L20 assume !(~p <= 0); 295928#L21 assume !(~q <= 0); 295926#L22 assume !(~q > ~p); 295927#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296607#$Ultimate##0 ~p := #in~p;~q := #in~q; 296698#L20 assume ~p <= 0;#res := 1; 296602#partsFINAL assume true; 296605#partsEXIT >#67#return; 296585#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296591#$Ultimate##0 ~p := #in~p;~q := #in~q; 296700#L20 assume !(~p <= 0); 296697#L21 assume !(~q <= 0); 296621#L22 assume !(~q > ~p); 296622#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296653#$Ultimate##0 ~p := #in~p;~q := #in~q; 296664#L20 assume ~p <= 0;#res := 1; 296660#partsFINAL assume true; 296651#partsEXIT >#67#return; 296024#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296616#$Ultimate##0 ~p := #in~p;~q := #in~q; 296676#L20 assume !(~p <= 0); 296673#L21 assume !(~q <= 0); 296672#L22 assume !(~q > ~p); 296652#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296653#$Ultimate##0 ~p := #in~p;~q := #in~q; 296664#L20 assume ~p <= 0;#res := 1; 296660#partsFINAL assume true; 296651#partsEXIT >#67#return; 296021#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296616#$Ultimate##0 ~p := #in~p;~q := #in~q; 296676#L20 assume !(~p <= 0); 296673#L21 assume !(~q <= 0); 296672#L22 assume !(~q > ~p); 296652#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296653#$Ultimate##0 ~p := #in~p;~q := #in~q; 296664#L20 assume ~p <= 0;#res := 1; 296660#partsFINAL assume true; 296651#partsEXIT >#67#return; 296021#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296616#$Ultimate##0 ~p := #in~p;~q := #in~q; 296676#L20 assume !(~p <= 0); 296673#L21 assume !(~q <= 0); 296672#L22 assume !(~q > ~p); 296652#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296653#$Ultimate##0 ~p := #in~p;~q := #in~q; 296664#L20 assume ~p <= 0;#res := 1; 296660#partsFINAL assume true; 296651#partsEXIT >#67#return; 296021#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296616#$Ultimate##0 ~p := #in~p;~q := #in~q; 296676#L20 assume !(~p <= 0); 296673#L21 assume !(~q <= 0); 296672#L22 assume ~q > ~p; 296185#L22-1 call #t~ret0 := parts(~p, ~p);< 296202#$Ultimate##0 ~p := #in~p;~q := #in~q; 296203#L20 assume !(~p <= 0); 296630#L21 assume !(~q <= 0); 296629#L22 assume !(~q > ~p); 296182#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296189#$Ultimate##0 ~p := #in~p;~q := #in~q; 296633#L20 assume ~p <= 0;#res := 1; 296180#partsFINAL assume true; 296183#partsEXIT >#67#return; 296624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296031#$Ultimate##0 ~p := #in~p;~q := #in~q; 296665#L20 assume !(~p <= 0); 296663#L21 assume !(~q <= 0); 296661#L22 assume !(~q > ~p); 296662#L23 call #t~ret1 := parts(~p - ~q, ~q);< 296760#$Ultimate##0 ~p := #in~p;~q := #in~q; 296768#L20 assume ~p <= 0;#res := 1; 296766#partsFINAL assume true; 296759#partsEXIT >#67#return; 296645#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 296646#$Ultimate##0 ~p := #in~p;~q := #in~q; 296740#L20 assume !(~p <= 0); 298863#L21 assume ~q <= 0;#res := 0; 296692#partsFINAL assume true; 296696#partsEXIT >#69#return; 296636#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296634#partsFINAL assume true; 296625#partsEXIT >#69#return; 296029#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296756#partsFINAL assume true; 296754#partsEXIT >#65#return; 296753#L22-2 #res := #t~ret0;havoc #t~ret0; 296752#partsFINAL assume true; 296750#partsEXIT >#69#return; 296751#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296792#partsFINAL assume true; 296020#partsEXIT >#69#return; 296027#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296632#partsFINAL assume true; 296628#partsEXIT >#69#return; 296027#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296632#partsFINAL assume true; 296628#partsEXIT >#69#return; 296028#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296717#partsFINAL assume true; 296714#partsEXIT >#69#return; 296706#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296599#partsFINAL assume true; 296600#partsEXIT >#67#return; 295644#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295649#$Ultimate##0 ~p := #in~p;~q := #in~q; 295682#L20 assume !(~p <= 0); 295656#L21 assume ~q <= 0;#res := 0; 295650#partsFINAL assume true; 295639#partsEXIT >#69#return; 295321#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295632#partsFINAL assume true; 295609#partsEXIT >#69#return; 295477#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295472#partsFINAL assume true; 295460#partsEXIT >#65#return; 295459#L22-2 #res := #t~ret0;havoc #t~ret0; 295456#partsFINAL assume true; 295289#partsEXIT >#71#return; 295286#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295285#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295276#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295280#$Ultimate##0 ~p := #in~p;~q := #in~q; 295371#L20 assume !(~p <= 0); 295366#L21 assume !(~q <= 0); 295362#L22 assume ~q > ~p; 295340#L22-1 call #t~ret0 := parts(~p, ~p);< 295354#$Ultimate##0 ~p := #in~p;~q := #in~q; 297283#L20 assume !(~p <= 0); 297285#L21 assume !(~q <= 0); 297278#L22 assume !(~q > ~p); 297256#L23 call #t~ret1 := parts(~p - ~q, ~q);< 297262#$Ultimate##0 ~p := #in~p;~q := #in~q; 298198#L20 assume ~p <= 0;#res := 1; 298194#partsFINAL assume true; 298191#partsEXIT >#67#return; 295369#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295370#$Ultimate##0 ~p := #in~p;~q := #in~q; 298224#L20 assume !(~p <= 0); 298215#L21 assume !(~q <= 0); 298209#L22 assume !(~q > ~p); 298210#L23 call #t~ret1 := parts(~p - ~q, ~q);< 298445#$Ultimate##0 ~p := #in~p;~q := #in~q; 298513#L20 assume !(~p <= 0); 298508#L21 assume !(~q <= 0); 298494#L22 assume !(~q > ~p); 298477#L23 call #t~ret1 := parts(~p - ~q, ~q);< 298487#$Ultimate##0 ~p := #in~p;~q := #in~q; 298527#L20 assume ~p <= 0;#res := 1; 298512#partsFINAL assume true; 298476#partsEXIT >#67#return; 298464#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 298468#$Ultimate##0 ~p := #in~p;~q := #in~q; 298646#L20 assume !(~p <= 0); 298645#L21 assume ~q <= 0;#res := 0; 298628#partsFINAL assume true; 298462#partsEXIT >#69#return; 298450#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 298447#partsFINAL assume true; 298443#partsEXIT >#67#return; 297592#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 297605#$Ultimate##0 ~p := #in~p;~q := #in~q; 297654#L20 assume !(~p <= 0); 297615#L21 assume ~q <= 0;#res := 0; 297606#partsFINAL assume true; 297591#partsEXIT >#69#return; 297598#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 298325#partsFINAL assume true; 298362#partsEXIT >#69#return; 295365#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295355#partsFINAL assume true; 295332#partsEXIT >#65#return; 295331#L22-2 #res := #t~ret0;havoc #t~ret0; 295330#partsFINAL assume true; 295329#partsEXIT >#71#return; 295244#L36-1 [2024-10-13 16:58:13,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1691129564, now seen corresponding path program 5 times [2024-10-13 16:58:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963070247] [2024-10-13 16:58:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:58:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:58:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 16:58:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 113 proven. 38 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-13 16:58:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:13,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963070247] [2024-10-13 16:58:13,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963070247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:13,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330681289] [2024-10-13 16:58:13,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:58:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,969 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2024-10-13 16:58:14,038 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-13 16:58:14,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:14,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 123 proven. 15 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-13 16:58:14,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 123 proven. 19 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 16:58:14,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330681289] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:14,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 16 [2024-10-13 16:58:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969805376] [2024-10-13 16:58:14,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:14,522 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:14,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1273981174, now seen corresponding path program 3 times [2024-10-13 16:58:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:14,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908358996] [2024-10-13 16:58:14,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 16:58:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 16:58:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 16:58:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 16:58:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 16:58:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3901 backedges. 139 proven. 435 refuted. 0 times theorem prover too weak. 3327 trivial. 0 not checked. [2024-10-13 16:58:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908358996] [2024-10-13 16:58:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908358996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079255014] [2024-10-13 16:58:15,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:15,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:15,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:15,233 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:15,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2024-10-13 16:58:15,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 16:58:15,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:15,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3901 backedges. 1864 proven. 10 refuted. 0 times theorem prover too weak. 2027 trivial. 0 not checked. [2024-10-13 16:58:15,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3901 backedges. 671 proven. 293 refuted. 0 times theorem prover too weak. 2937 trivial. 0 not checked. [2024-10-13 16:58:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079255014] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:16,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:16,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 22 [2024-10-13 16:58:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557206362] [2024-10-13 16:58:16,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:16,711 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:16,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 16:58:16,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-13 16:58:16,711 INFO L87 Difference]: Start difference. First operand 4161 states and 6247 transitions. cyclomatic complexity: 2178 Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-13 16:58:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:16,875 INFO L93 Difference]: Finished difference Result 3590 states and 4552 transitions. [2024-10-13 16:58:16,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3590 states and 4552 transitions. [2024-10-13 16:58:16,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2024-10-13 16:58:16,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3590 states to 1180 states and 1413 transitions. [2024-10-13 16:58:16,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2024-10-13 16:58:16,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2024-10-13 16:58:16,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1180 states and 1413 transitions. [2024-10-13 16:58:16,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:16,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1180 states and 1413 transitions. [2024-10-13 16:58:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states and 1413 transitions. [2024-10-13 16:58:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1040. [2024-10-13 16:58:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 716 states have (on average 1.1033519553072626) internal successors, (790), 750 states have internal predecessors, (790), 201 states have call successors, (213), 143 states have call predecessors, (213), 123 states have return successors, (220), 146 states have call predecessors, (220), 186 states have call successors, (220) [2024-10-13 16:58:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1223 transitions. [2024-10-13 16:58:16,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1040 states and 1223 transitions. [2024-10-13 16:58:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 16:58:16,920 INFO L425 stractBuchiCegarLoop]: Abstraction has 1040 states and 1223 transitions. [2024-10-13 16:58:16,920 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-13 16:58:16,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1040 states and 1223 transitions. [2024-10-13 16:58:16,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2024-10-13 16:58:16,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:16,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:16,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:16,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 26, 21, 12, 10, 10, 10, 10, 10, 10, 9, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-13 16:58:16,928 INFO L745 eck$LassoCheckResult]: Stem: 306626#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 306579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 306580#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 306573#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 306574#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 306666#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306663#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306664#$Ultimate##0 ~p := #in~p;~q := #in~q; 306667#L20 assume ~p <= 0;#res := 1; 306665#partsFINAL assume true; 306662#partsEXIT >#71#return; 306660#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 306657#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306652#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306654#$Ultimate##0 ~p := #in~p;~q := #in~q; 306658#L20 assume ~p <= 0;#res := 1; 306655#partsFINAL assume true; 306651#partsEXIT >#71#return; 306650#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 306648#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306644#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306645#$Ultimate##0 ~p := #in~p;~q := #in~q; 306649#L20 assume ~p <= 0;#res := 1; 306647#partsFINAL assume true; 306643#partsEXIT >#71#return; 306642#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 306641#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 306602#L35-3 havoc main_~q~0#1; 306592#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 306593#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 306640#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306926#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306927#$Ultimate##0 ~p := #in~p;~q := #in~q; 306930#L20 assume !(~p <= 0); 306929#L21 assume ~q <= 0;#res := 0; 306928#partsFINAL assume true; 306925#partsEXIT >#71#return; 306900#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 306890#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306884#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306885#$Ultimate##0 ~p := #in~p;~q := #in~q; 306924#L20 assume !(~p <= 0); 306923#L21 assume !(~q <= 0); 306921#L22 assume !(~q > ~p); 306917#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306918#$Ultimate##0 ~p := #in~p;~q := #in~q; 306922#L20 assume ~p <= 0;#res := 1; 306920#partsFINAL assume true; 306916#partsEXIT >#67#return; 306898#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306899#$Ultimate##0 ~p := #in~p;~q := #in~q; 306911#L20 assume !(~p <= 0); 306909#L21 assume ~q <= 0;#res := 0; 306907#partsFINAL assume true; 306897#partsEXIT >#69#return; 306895#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 306889#partsFINAL assume true; 306883#partsEXIT >#71#return; 306879#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 306877#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306684#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306875#$Ultimate##0 ~p := #in~p;~q := #in~q; 307108#L20 assume !(~p <= 0); 307107#L21 assume !(~q <= 0); 307105#L22 assume ~q > ~p; 306708#L22-1 call #t~ret0 := parts(~p, ~p);< 306716#$Ultimate##0 ~p := #in~p;~q := #in~q; 306934#L20 assume !(~p <= 0); 306932#L21 assume !(~q <= 0); 306841#L22 assume !(~q > ~p); 306805#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306845#$Ultimate##0 ~p := #in~p;~q := #in~q; 306857#L20 assume ~p <= 0;#res := 1; 306856#partsFINAL assume true; 306804#partsEXIT >#67#return; 306720#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306799#$Ultimate##0 ~p := #in~p;~q := #in~q; 306793#L20 assume !(~p <= 0); 306791#L21 assume ~q <= 0;#res := 0; 306792#partsFINAL assume true; 306719#partsEXIT >#69#return; 306721#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307083#partsFINAL assume true; 307081#partsEXIT >#65#return; 307079#L22-2 #res := #t~ret0;havoc #t~ret0; 307078#partsFINAL assume true; 307049#partsEXIT >#71#return; 306669#L36-1 [2024-10-13 16:58:16,928 INFO L747 eck$LassoCheckResult]: Loop: 306669#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 306629#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 306600#L35-3 havoc main_~q~0#1; 306601#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 307021#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 307020#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306575#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306576#$Ultimate##0 ~p := #in~p;~q := #in~q; 306676#L20 assume !(~p <= 0); 306674#L21 assume ~q <= 0;#res := 0; 306675#partsFINAL assume true; 306670#partsEXIT >#71#return; 306671#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307016#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307013#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307014#$Ultimate##0 ~p := #in~p;~q := #in~q; 307039#L20 assume !(~p <= 0); 307038#L21 assume !(~q <= 0); 307037#L22 assume !(~q > ~p); 307035#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307036#$Ultimate##0 ~p := #in~p;~q := #in~q; 307075#L20 assume !(~p <= 0); 307074#L21 assume !(~q <= 0); 307072#L22 assume !(~q > ~p); 307073#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307124#$Ultimate##0 ~p := #in~p;~q := #in~q; 307115#L20 assume !(~p <= 0); 307112#L21 assume !(~q <= 0); 307110#L22 assume !(~q > ~p); 307077#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307124#$Ultimate##0 ~p := #in~p;~q := #in~q; 307115#L20 assume !(~p <= 0); 307112#L21 assume !(~q <= 0); 307110#L22 assume !(~q > ~p); 307070#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307071#$Ultimate##0 ~p := #in~p;~q := #in~q; 307205#L20 assume ~p <= 0;#res := 1; 307204#partsFINAL assume true; 307068#partsEXIT >#67#return; 307064#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307067#$Ultimate##0 ~p := #in~p;~q := #in~q; 307082#L20 assume !(~p <= 0); 307080#L21 assume ~q <= 0;#res := 0; 307076#partsFINAL assume true; 307063#partsEXIT >#69#return; 307066#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307197#partsFINAL assume true; 307154#partsEXIT >#67#return; 307064#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307067#$Ultimate##0 ~p := #in~p;~q := #in~q; 307082#L20 assume !(~p <= 0); 307080#L21 assume ~q <= 0;#res := 0; 307076#partsFINAL assume true; 307063#partsEXIT >#69#return; 307066#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307197#partsFINAL assume true; 307154#partsEXIT >#67#return; 307065#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307067#$Ultimate##0 ~p := #in~p;~q := #in~q; 307082#L20 assume !(~p <= 0); 307080#L21 assume ~q <= 0;#res := 0; 307076#partsFINAL assume true; 307063#partsEXIT >#69#return; 307062#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307061#partsFINAL assume true; 307034#partsEXIT >#67#return; 307032#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307033#$Ultimate##0 ~p := #in~p;~q := #in~q; 307044#L20 assume !(~p <= 0); 307043#L21 assume ~q <= 0;#res := 0; 307042#partsFINAL assume true; 307031#partsEXIT >#69#return; 307030#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307028#partsFINAL assume true; 307012#partsEXIT >#71#return; 307010#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307008#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306583#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306999#$Ultimate##0 ~p := #in~p;~q := #in~q; 307142#L20 assume !(~p <= 0); 307140#L21 assume !(~q <= 0); 307136#L22 assume ~q > ~p; 307120#L22-1 call #t~ret0 := parts(~p, ~p);< 307123#$Ultimate##0 ~p := #in~p;~q := #in~q; 307180#L20 assume !(~p <= 0); 307179#L21 assume !(~q <= 0); 307177#L22 assume !(~q > ~p); 307174#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306905#$Ultimate##0 ~p := #in~p;~q := #in~q; 307178#L20 assume ~p <= 0;#res := 1; 307176#partsFINAL assume true; 307173#partsEXIT >#67#return; 307130#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307363#$Ultimate##0 ~p := #in~p;~q := #in~q; 307362#L20 assume !(~p <= 0); 307361#L21 assume !(~q <= 0); 307360#L22 assume !(~q > ~p); 307307#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307358#$Ultimate##0 ~p := #in~p;~q := #in~q; 307357#L20 assume !(~p <= 0); 307355#L21 assume !(~q <= 0); 307352#L22 assume !(~q > ~p); 307324#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307326#$Ultimate##0 ~p := #in~p;~q := #in~q; 307373#L20 assume ~p <= 0;#res := 1; 307364#partsFINAL assume true; 307323#partsEXIT >#67#return; 307312#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307315#$Ultimate##0 ~p := #in~p;~q := #in~q; 307331#L20 assume !(~p <= 0); 307329#L21 assume ~q <= 0;#res := 0; 307322#partsFINAL assume true; 307310#partsEXIT >#69#return; 307306#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307308#partsFINAL assume true; 307359#partsEXIT >#67#return; 307298#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307192#$Ultimate##0 ~p := #in~p;~q := #in~q; 307303#L20 assume !(~p <= 0); 307302#L21 assume ~q <= 0;#res := 0; 307301#partsFINAL assume true; 307295#partsEXIT >#69#return; 307162#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307163#partsFINAL assume true; 307129#partsEXIT >#69#return; 307127#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307125#partsFINAL assume true; 307117#partsEXIT >#65#return; 307122#L22-2 #res := #t~ret0;havoc #t~ret0; 307482#partsFINAL assume true; 307029#partsEXIT >#71#return; 307027#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307007#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 306582#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 306996#$Ultimate##0 ~p := #in~p;~q := #in~q; 306993#L20 assume !(~p <= 0); 306989#L21 assume !(~q <= 0); 306987#L22 assume ~q > ~p; 306711#L22-1 call #t~ret0 := parts(~p, ~p);< 306863#$Ultimate##0 ~p := #in~p;~q := #in~q; 306860#L20 assume !(~p <= 0); 306858#L21 assume !(~q <= 0); 306849#L22 assume !(~q > ~p); 306844#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306807#$Ultimate##0 ~p := #in~p;~q := #in~q; 306850#L20 assume ~p <= 0;#res := 1; 306847#partsFINAL assume true; 306843#partsEXIT >#67#return; 306728#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306729#$Ultimate##0 ~p := #in~p;~q := #in~q; 306836#L20 assume !(~p <= 0); 306833#L21 assume !(~q <= 0); 306802#L22 assume !(~q > ~p); 306796#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306798#$Ultimate##0 ~p := #in~p;~q := #in~q; 306978#L20 assume !(~p <= 0); 306976#L21 assume !(~q <= 0); 306977#L22 assume !(~q > ~p); 306817#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306822#$Ultimate##0 ~p := #in~p;~q := #in~q; 306832#L20 assume ~p <= 0;#res := 1; 307591#partsFINAL assume true; 306816#partsEXIT >#67#return; 306811#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306814#$Ultimate##0 ~p := #in~p;~q := #in~q; 306821#L20 assume !(~p <= 0); 306820#L21 assume ~q <= 0;#res := 0; 306815#partsFINAL assume true; 306809#partsEXIT >#69#return; 306803#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 306800#partsFINAL assume true; 306794#partsEXIT >#67#return; 306735#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306740#$Ultimate##0 ~p := #in~p;~q := #in~q; 306751#L20 assume !(~p <= 0); 306746#L21 assume ~q <= 0;#res := 0; 306742#partsFINAL assume true; 306733#partsEXIT >#69#return; 306737#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 306786#partsFINAL assume true; 306787#partsEXIT >#69#return; 306718#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 306717#partsFINAL assume true; 306703#partsEXIT >#65#return; 306715#L22-2 #res := #t~ret0;havoc #t~ret0; 307052#partsFINAL assume true; 307048#partsEXIT >#71#return; 306669#L36-1 [2024-10-13 16:58:16,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 6 times [2024-10-13 16:58:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604732543] [2024-10-13 16:58:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:16,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:16,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -159308215, now seen corresponding path program 4 times [2024-10-13 16:58:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131858722] [2024-10-13 16:58:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 16:58:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 16:58:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 16:58:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 16:58:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 112 proven. 265 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2024-10-13 16:58:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131858722] [2024-10-13 16:58:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131858722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593899911] [2024-10-13 16:58:17,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:58:17,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:17,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:17,486 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:17,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2024-10-13 16:58:17,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:58:17,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:17,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:58:17,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 883 proven. 251 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-10-13 16:58:17,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 120 proven. 474 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2024-10-13 16:58:18,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593899911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:18,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:18,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 19] total 32 [2024-10-13 16:58:18,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831463229] [2024-10-13 16:58:18,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:18,676 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 16:58:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2024-10-13 16:58:18,678 INFO L87 Difference]: Start difference. First operand 1040 states and 1223 transitions. cyclomatic complexity: 201 Second operand has 32 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 states have internal predecessors, (88), 21 states have call successors, (29), 2 states have call predecessors, (29), 7 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2024-10-13 16:58:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:19,443 INFO L93 Difference]: Finished difference Result 1569 states and 1976 transitions. [2024-10-13 16:58:19,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1569 states and 1976 transitions. [2024-10-13 16:58:19,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2024-10-13 16:58:19,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1569 states to 1499 states and 1840 transitions. [2024-10-13 16:58:19,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2024-10-13 16:58:19,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2024-10-13 16:58:19,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1499 states and 1840 transitions. [2024-10-13 16:58:19,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:19,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1499 states and 1840 transitions. [2024-10-13 16:58:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states and 1840 transitions. [2024-10-13 16:58:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1280. [2024-10-13 16:58:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 863 states have (on average 1.0938586326767092) internal successors, (944), 898 states have internal predecessors, (944), 255 states have call successors, (270), 164 states have call predecessors, (270), 162 states have return successors, (331), 217 states have call predecessors, (331), 228 states have call successors, (331) [2024-10-13 16:58:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1545 transitions. [2024-10-13 16:58:19,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1280 states and 1545 transitions. [2024-10-13 16:58:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 16:58:19,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 1280 states and 1545 transitions. [2024-10-13 16:58:19,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-13 16:58:19,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1280 states and 1545 transitions. [2024-10-13 16:58:19,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-10-13 16:58:19,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:19,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:19,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:19,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 16, 9, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:19,498 INFO L745 eck$LassoCheckResult]: Stem: 310954#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 310893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 310894#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 310891#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 310892#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 310967#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310997#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310998#$Ultimate##0 ~p := #in~p;~q := #in~q; 311000#L20 assume ~p <= 0;#res := 1; 310999#partsFINAL assume true; 310996#partsEXIT >#71#return; 310994#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310992#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310988#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310990#$Ultimate##0 ~p := #in~p;~q := #in~q; 310993#L20 assume ~p <= 0;#res := 1; 310991#partsFINAL assume true; 310987#partsEXIT >#71#return; 310980#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310979#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310974#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310975#$Ultimate##0 ~p := #in~p;~q := #in~q; 310978#L20 assume ~p <= 0;#res := 1; 310977#partsFINAL assume true; 310973#partsEXIT >#71#return; 310970#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310969#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 310916#L35-3 havoc main_~q~0#1; 310912#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 310913#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 310968#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311106#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311107#$Ultimate##0 ~p := #in~p;~q := #in~q; 311266#L20 assume !(~p <= 0); 311265#L21 assume ~q <= 0;#res := 0; 311264#partsFINAL assume true; 311192#partsEXIT >#71#return; 311188#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311187#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310897#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310898#$Ultimate##0 ~p := #in~p;~q := #in~q; 311700#L20 assume !(~p <= 0); 311699#L21 assume !(~q <= 0); 311696#L22 assume !(~q > ~p); 311692#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311693#$Ultimate##0 ~p := #in~p;~q := #in~q; 311698#L20 assume ~p <= 0;#res := 1; 311695#partsFINAL assume true; 311691#partsEXIT >#67#return; 311688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311689#$Ultimate##0 ~p := #in~p;~q := #in~q; 311697#L20 assume !(~p <= 0); 311694#L21 assume ~q <= 0;#res := 0; 311690#partsFINAL assume true; 311687#partsEXIT >#69#return; 311686#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311685#partsFINAL assume true; 311684#partsEXIT >#71#return; 311683#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311682#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311027#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311028#$Ultimate##0 ~p := #in~p;~q := #in~q; 311934#L20 assume !(~p <= 0); 311930#L21 assume !(~q <= 0); 311928#L22 assume ~q > ~p; 311918#L22-1 call #t~ret0 := parts(~p, ~p);< 311925#$Ultimate##0 ~p := #in~p;~q := #in~q; 311945#L20 assume !(~p <= 0); 311943#L21 assume !(~q <= 0); 311942#L22 assume !(~q > ~p); 311939#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311941#$Ultimate##0 ~p := #in~p;~q := #in~q; 311954#L20 assume ~p <= 0;#res := 1; 311953#partsFINAL assume true; 311938#partsEXIT >#67#return; 311932#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311933#$Ultimate##0 ~p := #in~p;~q := #in~q; 311946#L20 assume !(~p <= 0); 311944#L21 assume ~q <= 0;#res := 0; 311936#partsFINAL assume true; 311931#partsEXIT >#69#return; 311929#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311927#partsFINAL assume true; 311924#partsEXIT >#65#return; 311922#L22-2 #res := #t~ret0;havoc #t~ret0; 311920#partsFINAL assume true; 311919#partsEXIT >#71#return; 311022#L36-1 [2024-10-13 16:58:19,498 INFO L747 eck$LassoCheckResult]: Loop: 311022#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310971#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 310972#L35-3 havoc main_~q~0#1; 310910#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 310911#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 311016#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311004#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311005#$Ultimate##0 ~p := #in~p;~q := #in~q; 311021#L20 assume !(~p <= 0); 311020#L21 assume ~q <= 0;#res := 0; 311019#partsFINAL assume true; 311003#partsEXIT >#71#return; 310961#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310962#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311101#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311131#$Ultimate##0 ~p := #in~p;~q := #in~q; 311256#L20 assume !(~p <= 0); 311254#L21 assume !(~q <= 0); 311252#L22 assume !(~q > ~p); 311250#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311251#$Ultimate##0 ~p := #in~p;~q := #in~q; 311509#L20 assume !(~p <= 0); 311508#L21 assume !(~q <= 0); 311507#L22 assume !(~q > ~p); 311441#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311445#$Ultimate##0 ~p := #in~p;~q := #in~q; 311510#L20 assume ~p <= 0;#res := 1; 311462#partsFINAL assume true; 311440#partsEXIT >#67#return; 311443#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311488#$Ultimate##0 ~p := #in~p;~q := #in~q; 311504#L20 assume !(~p <= 0); 311503#L21 assume ~q <= 0;#res := 0; 311502#partsFINAL assume true; 311487#partsEXIT >#69#return; 311430#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311429#partsFINAL assume true; 311425#partsEXIT >#67#return; 311357#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311358#$Ultimate##0 ~p := #in~p;~q := #in~q; 311497#L20 assume !(~p <= 0); 311492#L21 assume ~q <= 0;#res := 0; 311490#partsFINAL assume true; 311356#partsEXIT >#69#return; 311354#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311351#partsFINAL assume true; 311130#partsEXIT >#71#return; 311127#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311123#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310903#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311111#$Ultimate##0 ~p := #in~p;~q := #in~q; 311170#L20 assume !(~p <= 0); 311165#L21 assume !(~q <= 0); 311162#L22 assume !(~q > ~p); 311157#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311159#$Ultimate##0 ~p := #in~p;~q := #in~q; 311347#L20 assume ~p <= 0;#res := 1; 311186#partsFINAL assume true; 311156#partsEXIT >#67#return; 311135#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311141#$Ultimate##0 ~p := #in~p;~q := #in~q; 311222#L20 assume !(~p <= 0); 311220#L21 assume !(~q <= 0); 311218#L22 assume !(~q > ~p); 311181#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311207#$Ultimate##0 ~p := #in~p;~q := #in~q; 311371#L20 assume !(~p <= 0); 311369#L21 assume !(~q <= 0); 311370#L22 assume !(~q > ~p); 311287#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311288#$Ultimate##0 ~p := #in~p;~q := #in~q; 311408#L20 assume ~p <= 0;#res := 1; 311372#partsFINAL assume true; 311375#partsEXIT >#67#return; 311277#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311282#$Ultimate##0 ~p := #in~p;~q := #in~q; 311345#L20 assume !(~p <= 0); 311343#L21 assume ~q <= 0;#res := 0; 311289#partsFINAL assume true; 311276#partsEXIT >#69#return; 311274#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311272#partsFINAL assume true; 311176#partsEXIT >#67#return; 311173#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311174#$Ultimate##0 ~p := #in~p;~q := #in~q; 311239#L20 assume !(~p <= 0); 311237#L21 assume ~q <= 0;#res := 0; 311227#partsFINAL assume true; 311172#partsEXIT >#69#return; 311171#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311151#partsFINAL assume true; 311138#partsEXIT >#69#return; 311133#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311126#partsFINAL assume true; 311122#partsEXIT >#71#return; 311118#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311113#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310902#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311110#$Ultimate##0 ~p := #in~p;~q := #in~q; 311566#L20 assume !(~p <= 0); 311562#L21 assume !(~q <= 0); 311559#L22 assume ~q > ~p; 311552#L22-1 call #t~ret0 := parts(~p, ~p);< 311557#$Ultimate##0 ~p := #in~p;~q := #in~q; 311671#L20 assume !(~p <= 0); 311659#L21 assume !(~q <= 0); 311660#L22 assume !(~q > ~p); 311570#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311571#$Ultimate##0 ~p := #in~p;~q := #in~q; 311577#L20 assume ~p <= 0;#res := 1; 311573#partsFINAL assume true; 311568#partsEXIT >#67#return; 311564#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311565#$Ultimate##0 ~p := #in~p;~q := #in~q; 311598#L20 assume !(~p <= 0); 311590#L21 assume !(~q <= 0); 311587#L22 assume !(~q > ~p); 311580#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311583#$Ultimate##0 ~p := #in~p;~q := #in~q; 311657#L20 assume !(~p <= 0); 311653#L21 assume !(~q <= 0); 311650#L22 assume !(~q > ~p); 311605#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311607#$Ultimate##0 ~p := #in~p;~q := #in~q; 311668#L20 assume ~p <= 0;#res := 1; 311663#partsFINAL assume true; 311604#partsEXIT >#67#return; 311593#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311597#$Ultimate##0 ~p := #in~p;~q := #in~q; 311609#L20 assume !(~p <= 0); 311603#L21 assume ~q <= 0;#res := 0; 311599#partsFINAL assume true; 311591#partsEXIT >#69#return; 311589#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311585#partsFINAL assume true; 311579#partsEXIT >#67#return; 311575#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311576#$Ultimate##0 ~p := #in~p;~q := #in~q; 311588#L20 assume !(~p <= 0); 311584#L21 assume ~q <= 0;#res := 0; 311578#partsFINAL assume true; 311574#partsEXIT >#69#return; 311572#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311567#partsFINAL assume true; 311563#partsEXIT >#69#return; 311561#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311558#partsFINAL assume true; 311550#partsEXIT >#65#return; 311549#L22-2 #res := #t~ret0;havoc #t~ret0; 311546#partsFINAL assume true; 311544#partsEXIT >#71#return; 311022#L36-1 [2024-10-13 16:58:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 7 times [2024-10-13 16:58:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554821600] [2024-10-13 16:58:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:19,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -231649768, now seen corresponding path program 5 times [2024-10-13 16:58:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133778119] [2024-10-13 16:58:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1877905397, now seen corresponding path program 8 times [2024-10-13 16:58:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322201310] [2024-10-13 16:58:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:58:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:58:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 16:58:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 16:58:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 16:58:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 16:58:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 16:58:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 23 proven. 114 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-10-13 16:58:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322201310] [2024-10-13 16:58:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322201310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790081712] [2024-10-13 16:58:19,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,917 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2024-10-13 16:58:20,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:20,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:20,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:58:20,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 1018 proven. 80 refuted. 0 times theorem prover too weak. 1472 trivial. 0 not checked. [2024-10-13 16:58:20,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 23 proven. 114 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-10-13 16:58:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790081712] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:20,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:20,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2024-10-13 16:58:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010854995] [2024-10-13 16:58:20,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:21,842 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:21,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:21,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:21,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:21,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:21,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:21,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:21,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:21,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration22_Loop [2024-10-13 16:58:21,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:21,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:21,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,876 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:21,876 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:21,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:21,878 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:21,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-10-13 16:58:21,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:21,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:21,890 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:21,891 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:21,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-10-13 16:58:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:21,902 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:21,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-10-13 16:58:21,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:21,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:21,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-10-13 16:58:21,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:21,926 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:21,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-10-13 16:58:21,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:21,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:21,939 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:21,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-10-13 16:58:21,950 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:21,950 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:21,950 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:21,950 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:21,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:21,950 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:21,950 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:21,950 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:21,950 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration22_Loop [2024-10-13 16:58:21,950 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:21,950 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:21,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:21,986 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:21,986 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:21,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:21,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:21,987 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:21,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-10-13 16:58:21,988 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-13 16:58:21,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:21,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:21,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:21,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:21,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:22,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:22,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:22,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:22,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-10-13 16:58:22,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:22,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:22,012 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:22,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-13 16:58:22,014 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-13 16:58:22,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:22,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:22,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:22,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:22,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:22,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:22,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:22,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:22,029 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:22,029 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:22,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:22,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:22,030 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:22,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-13 16:58:22,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:22,031 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:22,031 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:22,031 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 3 Supporting invariants [] [2024-10-13 16:58:22,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-10-13 16:58:22,042 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:22,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:22,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 16:58:22,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:22,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 24 proven. 245 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-10-13 16:58:23,083 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2024-10-13 16:58:23,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1280 states and 1545 transitions. cyclomatic complexity: 284 Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2024-10-13 16:58:23,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1280 states and 1545 transitions. cyclomatic complexity: 284. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Result 3549 states and 4514 transitions. Complement of second has 121 states. [2024-10-13 16:58:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2024-10-13 16:58:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2024-10-13 16:58:23,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 87 letters. Loop has 151 letters. [2024-10-13 16:58:23,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:23,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 238 letters. Loop has 151 letters. [2024-10-13 16:58:23,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:23,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 87 letters. Loop has 302 letters. [2024-10-13 16:58:23,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:23,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3549 states and 4514 transitions. [2024-10-13 16:58:23,488 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2024-10-13 16:58:23,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3549 states to 3002 states and 3825 transitions. [2024-10-13 16:58:23,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2024-10-13 16:58:23,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 545 [2024-10-13 16:58:23,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3002 states and 3825 transitions. [2024-10-13 16:58:23,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:23,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3002 states and 3825 transitions. [2024-10-13 16:58:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states and 3825 transitions. [2024-10-13 16:58:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2453. [2024-10-13 16:58:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 1638 states have (on average 1.0787545787545787) internal successors, (1767), 1705 states have internal predecessors, (1767), 488 states have call successors, (520), 293 states have call predecessors, (520), 327 states have return successors, (704), 454 states have call predecessors, (704), 459 states have call successors, (704) [2024-10-13 16:58:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 2991 transitions. [2024-10-13 16:58:23,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2453 states and 2991 transitions. [2024-10-13 16:58:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 16:58:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-13 16:58:23,552 INFO L87 Difference]: Start difference. First operand 2453 states and 2991 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 12 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-13 16:58:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:23,652 INFO L93 Difference]: Finished difference Result 2597 states and 3178 transitions. [2024-10-13 16:58:23,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2597 states and 3178 transitions. [2024-10-13 16:58:23,663 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 90 [2024-10-13 16:58:23,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2597 states to 2561 states and 3132 transitions. [2024-10-13 16:58:23,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2024-10-13 16:58:23,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 493 [2024-10-13 16:58:23,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2561 states and 3132 transitions. [2024-10-13 16:58:23,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:23,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2561 states and 3132 transitions. [2024-10-13 16:58:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states and 3132 transitions. [2024-10-13 16:58:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2500. [2024-10-13 16:58:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 1673 states have (on average 1.0777047220561864) internal successors, (1803), 1741 states have internal predecessors, (1803), 500 states have call successors, (533), 293 states have call predecessors, (533), 327 states have return successors, (715), 465 states have call predecessors, (715), 468 states have call successors, (715) [2024-10-13 16:58:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3051 transitions. [2024-10-13 16:58:23,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2500 states and 3051 transitions. [2024-10-13 16:58:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 16:58:23,714 INFO L425 stractBuchiCegarLoop]: Abstraction has 2500 states and 3051 transitions. [2024-10-13 16:58:23,714 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-13 16:58:23,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2500 states and 3051 transitions. [2024-10-13 16:58:23,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2024-10-13 16:58:23,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:23,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:23,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 17, 15, 11, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:23,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 16:58:23,722 INFO L745 eck$LassoCheckResult]: Stem: 323595#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 323543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 323544#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 323541#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 323542#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 323664#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 323661#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 323662#$Ultimate##0 ~p := #in~p;~q := #in~q; 323665#L20 assume ~p <= 0;#res := 1; 323663#partsFINAL assume true; 323660#partsEXIT >#71#return; 323657#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 323654#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 323649#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 323651#$Ultimate##0 ~p := #in~p;~q := #in~q; 323656#L20 assume ~p <= 0;#res := 1; 323653#partsFINAL assume true; 323648#partsEXIT >#71#return; 323650#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324088#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 323639#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 323643#$Ultimate##0 ~p := #in~p;~q := #in~q; 323637#L20 assume ~p <= 0;#res := 1; 323640#partsFINAL assume true; 323796#partsEXIT >#71#return; 323797#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324079#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 324077#L35-3 havoc main_~q~0#1; 323555#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 323556#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 323784#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 323777#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 323780#$Ultimate##0 ~p := #in~p;~q := #in~q; 323783#L20 assume !(~p <= 0); 323782#L21 assume ~q <= 0;#res := 0; 323781#partsFINAL assume true; 323776#partsEXIT >#71#return; 323779#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 323773#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 323752#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 323755#$Ultimate##0 ~p := #in~p;~q := #in~q; 323771#L20 assume !(~p <= 0); 323770#L21 assume !(~q <= 0); 323767#L22 assume !(~q > ~p); 323763#L23 call #t~ret1 := parts(~p - ~q, ~q);< 323764#$Ultimate##0 ~p := #in~p;~q := #in~q; 323769#L20 assume ~p <= 0;#res := 1; 323766#partsFINAL assume true; 323762#partsEXIT >#67#return; 323759#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 323760#$Ultimate##0 ~p := #in~p;~q := #in~q; 323768#L20 assume !(~p <= 0); 323765#L21 assume ~q <= 0;#res := 0; 323761#partsFINAL assume true; 323758#partsEXIT >#69#return; 323757#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 323756#partsFINAL assume true; 323751#partsEXIT >#71#return; 323748#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 323749#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324708#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324715#$Ultimate##0 ~p := #in~p;~q := #in~q; 324752#L20 assume !(~p <= 0); 324743#L21 assume !(~q <= 0); 324744#L22 assume ~q > ~p; 324724#L22-1 call #t~ret0 := parts(~p, ~p);< 324725#$Ultimate##0 ~p := #in~p;~q := #in~q; 324751#L20 assume !(~p <= 0); 325322#L21 assume !(~q <= 0); 325320#L22 assume !(~q > ~p); 325053#L23 call #t~ret1 := parts(~p - ~q, ~q);< 325055#$Ultimate##0 ~p := #in~p;~q := #in~q; 325427#L20 assume ~p <= 0;#res := 1; 325391#partsFINAL assume true; 325052#partsEXIT >#67#return; 324807#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 325304#$Ultimate##0 ~p := #in~p;~q := #in~q; 325301#L20 assume !(~p <= 0); 325294#L21 assume !(~q <= 0); 325207#L22 assume !(~q > ~p); 325016#L23 call #t~ret1 := parts(~p - ~q, ~q);< 325018#$Ultimate##0 ~p := #in~p;~q := #in~q; 325043#L20 assume !(~p <= 0); 325042#L21 assume !(~q <= 0); 325040#L22 assume ~q > ~p; 325037#L22-1 call #t~ret0 := parts(~p, ~p);< 325038#$Ultimate##0 ~p := #in~p;~q := #in~q; 325096#L20 assume !(~p <= 0); 325066#L21 assume !(~q <= 0); 325060#L22 assume !(~q > ~p); 325057#L23 call #t~ret1 := parts(~p - ~q, ~q);< 325058#$Ultimate##0 ~p := #in~p;~q := #in~q; 325093#L20 assume ~p <= 0;#res := 1; 325092#partsFINAL assume true; 325056#partsEXIT >#67#return; 325050#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 325051#$Ultimate##0 ~p := #in~p;~q := #in~q; 325083#L20 assume !(~p <= 0); 325082#L21 assume ~q <= 0;#res := 0; 325081#partsFINAL assume true; 325049#partsEXIT >#69#return; 325048#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 325046#partsFINAL assume true; 325036#partsEXIT >#65#return; 325034#L22-2 #res := #t~ret0;havoc #t~ret0; 325026#partsFINAL assume true; 325014#partsEXIT >#67#return; 324948#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 325005#$Ultimate##0 ~p := #in~p;~q := #in~q; 324999#L20 assume !(~p <= 0); 324998#L21 assume !(~q <= 0); 324997#L22 assume !(~q > ~p); 324910#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324983#$Ultimate##0 ~p := #in~p;~q := #in~q; 325002#L20 assume ~p <= 0;#res := 1; 324990#partsFINAL assume true; 324980#partsEXIT >#67#return; 324855#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324974#$Ultimate##0 ~p := #in~p;~q := #in~q; 324970#L20 assume !(~p <= 0); 324968#L21 assume !(~q <= 0); 324908#L22 assume !(~q > ~p); 324900#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324903#$Ultimate##0 ~p := #in~p;~q := #in~q; 325216#L20 assume !(~p <= 0); 325214#L21 assume !(~q <= 0); 325212#L22 assume ~q > ~p; 324925#L22-1 call #t~ret0 := parts(~p, ~p);< 324926#$Ultimate##0 ~p := #in~p;~q := #in~q; 325228#L20 assume !(~p <= 0); 325226#L21 assume !(~q <= 0); 325224#L22 assume !(~q > ~p); 325221#L23 call #t~ret1 := parts(~p - ~q, ~q);< 325222#$Ultimate##0 ~p := #in~p;~q := #in~q; 325231#L20 assume ~p <= 0;#res := 1; 325229#partsFINAL assume true; 325220#partsEXIT >#67#return; 324942#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324943#$Ultimate##0 ~p := #in~p;~q := #in~q; 325297#L20 assume !(~p <= 0); 325296#L21 assume ~q <= 0;#res := 0; 325219#partsFINAL assume true; 324941#partsEXIT >#69#return; 324939#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324937#partsFINAL assume true; 324924#partsEXIT >#65#return; 324923#L22-2 #res := #t~ret0;havoc #t~ret0; 324916#partsFINAL assume true; 324899#partsEXIT >#67#return; 324842#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324853#$Ultimate##0 ~p := #in~p;~q := #in~q; 324851#L20 assume !(~p <= 0); 324849#L21 assume !(~q <= 0); 324846#L22 assume ~q > ~p; 324847#L22-1 [2024-10-13 16:58:23,722 INFO L747 eck$LassoCheckResult]: Loop: 324847#L22-1 call #t~ret0 := parts(~p, ~p);< 324946#$Ultimate##0 ~p := #in~p;~q := #in~q; 324944#L20 assume !(~p <= 0); 324940#L21 assume !(~q <= 0); 324938#L22 assume !(~q > ~p); 324935#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324936#$Ultimate##0 ~p := #in~p;~q := #in~q; 325211#L20 assume ~p <= 0;#res := 1; 325210#partsFINAL assume true; 324933#partsEXIT >#67#return; 324808#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324932#$Ultimate##0 ~p := #in~p;~q := #in~q; 324931#L20 assume !(~p <= 0); 324929#L21 assume !(~q <= 0); 324927#L22 assume !(~q > ~p); 324887#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324903#$Ultimate##0 ~p := #in~p;~q := #in~q; 325216#L20 assume !(~p <= 0); 325214#L21 assume !(~q <= 0); 325212#L22 assume ~q > ~p; 324925#L22-1 call #t~ret0 := parts(~p, ~p);< 324926#$Ultimate##0 ~p := #in~p;~q := #in~q; 325228#L20 assume !(~p <= 0); 325226#L21 assume !(~q <= 0); 325224#L22 assume !(~q > ~p); 325221#L23 call #t~ret1 := parts(~p - ~q, ~q);< 325222#$Ultimate##0 ~p := #in~p;~q := #in~q; 325231#L20 assume ~p <= 0;#res := 1; 325229#partsFINAL assume true; 325220#partsEXIT >#67#return; 324942#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324943#$Ultimate##0 ~p := #in~p;~q := #in~q; 325297#L20 assume !(~p <= 0); 325296#L21 assume ~q <= 0;#res := 0; 325219#partsFINAL assume true; 324941#partsEXIT >#69#return; 324939#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324937#partsFINAL assume true; 324924#partsEXIT >#65#return; 324923#L22-2 #res := #t~ret0;havoc #t~ret0; 324916#partsFINAL assume true; 324899#partsEXIT >#67#return; 324843#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324853#$Ultimate##0 ~p := #in~p;~q := #in~q; 324851#L20 assume !(~p <= 0); 324849#L21 assume !(~q <= 0); 324846#L22 assume ~q > ~p; 324847#L22-1 [2024-10-13 16:58:23,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash 352284645, now seen corresponding path program 9 times [2024-10-13 16:58:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:23,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107224373] [2024-10-13 16:58:23,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:58:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:58:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 16:58:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 16:58:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 16:58:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 16:58:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 230 proven. 163 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2024-10-13 16:58:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107224373] [2024-10-13 16:58:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107224373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13293335] [2024-10-13 16:58:23,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:23,865 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:23,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2024-10-13 16:58:23,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 16:58:23,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:23,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:58:23,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 79 proven. 1 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-10-13 16:58:23,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 79 proven. 1 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-10-13 16:58:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13293335] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:24,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:24,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 15 [2024-10-13 16:58:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089167262] [2024-10-13 16:58:24,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:24,088 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 851588807, now seen corresponding path program 1 times [2024-10-13 16:58:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961789888] [2024-10-13 16:58:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 16:58:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 16:58:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-13 16:58:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961789888] [2024-10-13 16:58:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961789888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281903136] [2024-10-13 16:58:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:24,169 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:24,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2024-10-13 16:58:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 16:58:24,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-13 16:58:24,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-13 16:58:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281903136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:24,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 16:58:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88007644] [2024-10-13 16:58:24,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:24,358 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:24,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 16:58:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-13 16:58:24,359 INFO L87 Difference]: Start difference. First operand 2500 states and 3051 transitions. cyclomatic complexity: 575 Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 16:58:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:24,514 INFO L93 Difference]: Finished difference Result 2644 states and 3224 transitions. [2024-10-13 16:58:24,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2644 states and 3224 transitions. [2024-10-13 16:58:24,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-10-13 16:58:24,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2644 states to 2167 states and 2667 transitions. [2024-10-13 16:58:24,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2024-10-13 16:58:24,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2024-10-13 16:58:24,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2167 states and 2667 transitions. [2024-10-13 16:58:24,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:24,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2167 states and 2667 transitions. [2024-10-13 16:58:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states and 2667 transitions. [2024-10-13 16:58:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2065. [2024-10-13 16:58:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 1377 states have (on average 1.0610021786492374) internal successors, (1461), 1437 states have internal predecessors, (1461), 399 states have call successors, (418), 234 states have call predecessors, (418), 289 states have return successors, (632), 393 states have call predecessors, (632), 399 states have call successors, (632) [2024-10-13 16:58:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2511 transitions. [2024-10-13 16:58:24,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2065 states and 2511 transitions. [2024-10-13 16:58:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 16:58:24,568 INFO L425 stractBuchiCegarLoop]: Abstraction has 2065 states and 2511 transitions. [2024-10-13 16:58:24,568 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-13 16:58:24,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2065 states and 2511 transitions. [2024-10-13 16:58:24,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-10-13 16:58:24,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:24,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:24,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:24,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 18, 10, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:24,574 INFO L745 eck$LassoCheckResult]: Stem: 330172#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 330140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 330141#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 330134#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 330135#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 330181#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330355#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330356#$Ultimate##0 ~p := #in~p;~q := #in~q; 330365#L20 assume ~p <= 0;#res := 1; 330359#partsFINAL assume true; 330354#partsEXIT >#71#return; 330353#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330352#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330350#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330351#$Ultimate##0 ~p := #in~p;~q := #in~q; 330358#L20 assume ~p <= 0;#res := 1; 330357#partsFINAL assume true; 330349#partsEXIT >#71#return; 330347#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330345#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330344#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330336#$Ultimate##0 ~p := #in~p;~q := #in~q; 330348#L20 assume ~p <= 0;#res := 1; 330346#partsFINAL assume true; 330343#partsEXIT >#71#return; 330341#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330339#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330335#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330337#$Ultimate##0 ~p := #in~p;~q := #in~q; 330342#L20 assume ~p <= 0;#res := 1; 330340#partsFINAL assume true; 330334#partsEXIT >#71#return; 330332#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330196#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 330197#L35-3 havoc main_~q~0#1; 330150#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 330151#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 330325#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330323#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330324#$Ultimate##0 ~p := #in~p;~q := #in~q; 330331#L20 assume !(~p <= 0); 330329#L21 assume ~q <= 0;#res := 0; 330327#partsFINAL assume true; 330322#partsEXIT >#71#return; 330313#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330309#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330303#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330304#$Ultimate##0 ~p := #in~p;~q := #in~q; 330330#L20 assume !(~p <= 0); 330328#L21 assume !(~q <= 0); 330326#L22 assume !(~q > ~p); 330319#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330320#$Ultimate##0 ~p := #in~p;~q := #in~q; 330338#L20 assume ~p <= 0;#res := 1; 330333#partsFINAL assume true; 330318#partsEXIT >#67#return; 330311#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330312#$Ultimate##0 ~p := #in~p;~q := #in~q; 330361#L20 assume !(~p <= 0); 330315#L21 assume ~q <= 0;#res := 0; 330314#partsFINAL assume true; 330310#partsEXIT >#69#return; 330308#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330307#partsFINAL assume true; 330302#partsEXIT >#71#return; 330298#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330296#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330238#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330234#$Ultimate##0 ~p := #in~p;~q := #in~q; 330366#L20 assume !(~p <= 0); 330360#L21 assume !(~q <= 0); 330292#L22 assume ~q > ~p; 330288#L22-1 call #t~ret0 := parts(~p, ~p);< 330301#$Ultimate##0 ~p := #in~p;~q := #in~q; 330378#L20 assume !(~p <= 0); 330377#L21 assume !(~q <= 0); 330374#L22 assume !(~q > ~p); 330369#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330371#$Ultimate##0 ~p := #in~p;~q := #in~q; 330376#L20 assume ~p <= 0;#res := 1; 330373#partsFINAL assume true; 330368#partsEXIT >#67#return; 330363#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330364#$Ultimate##0 ~p := #in~p;~q := #in~q; 330375#L20 assume !(~p <= 0); 330372#L21 assume ~q <= 0;#res := 0; 330367#partsFINAL assume true; 330362#partsEXIT >#69#return; 330316#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330305#partsFINAL assume true; 330300#partsEXIT >#65#return; 330297#L22-2 #res := #t~ret0;havoc #t~ret0; 330295#partsFINAL assume true; 330293#partsEXIT >#71#return; 330281#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330239#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330188#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330233#$Ultimate##0 ~p := #in~p;~q := #in~q; 330257#L20 assume !(~p <= 0); 330253#L21 assume !(~q <= 0); 330251#L22 assume ~q > ~p; 330248#L22-1 call #t~ret0 := parts(~p, ~p);< 330249#$Ultimate##0 ~p := #in~p;~q := #in~q; 330269#L20 assume !(~p <= 0); 330268#L21 assume !(~q <= 0); 330265#L22 assume !(~q > ~p); 330260#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330262#$Ultimate##0 ~p := #in~p;~q := #in~q; 330267#L20 assume ~p <= 0;#res := 1; 330264#partsFINAL assume true; 330259#partsEXIT >#67#return; 330255#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330256#$Ultimate##0 ~p := #in~p;~q := #in~q; 330266#L20 assume !(~p <= 0); 330263#L21 assume ~q <= 0;#res := 0; 330258#partsFINAL assume true; 330254#partsEXIT >#69#return; 330252#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330250#partsFINAL assume true; 330247#partsEXIT >#65#return; 330246#L22-2 #res := #t~ret0;havoc #t~ret0; 330245#partsFINAL assume true; 330186#partsEXIT >#71#return; 330185#L36-1 [2024-10-13 16:58:24,574 INFO L747 eck$LassoCheckResult]: Loop: 330185#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330175#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 330155#L35-3 havoc main_~q~0#1; 330148#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 330149#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 330184#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330136#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330137#$Ultimate##0 ~p := #in~p;~q := #in~q; 330195#L20 assume !(~p <= 0); 330194#L21 assume ~q <= 0;#res := 0; 330193#partsFINAL assume true; 330192#partsEXIT >#71#return; 330178#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330179#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330685#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330686#$Ultimate##0 ~p := #in~p;~q := #in~q; 330716#L20 assume !(~p <= 0); 330713#L21 assume !(~q <= 0); 330710#L22 assume !(~q > ~p); 330708#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330709#$Ultimate##0 ~p := #in~p;~q := #in~q; 330738#L20 assume !(~p <= 0); 330731#L21 assume !(~q <= 0); 330727#L22 assume !(~q > ~p); 330724#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330726#$Ultimate##0 ~p := #in~p;~q := #in~q; 330745#L20 assume !(~p <= 0); 330742#L21 assume !(~q <= 0); 330733#L22 assume !(~q > ~p); 330734#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330740#$Ultimate##0 ~p := #in~p;~q := #in~q; 330744#L20 assume ~p <= 0;#res := 1; 330741#partsFINAL assume true; 330739#partsEXIT >#67#return; 330736#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330737#$Ultimate##0 ~p := #in~p;~q := #in~q; 330747#L20 assume !(~p <= 0); 330746#L21 assume ~q <= 0;#res := 0; 330743#partsFINAL assume true; 330735#partsEXIT >#69#return; 330730#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330729#partsFINAL assume true; 330725#partsEXIT >#67#return; 330718#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330721#$Ultimate##0 ~p := #in~p;~q := #in~q; 330732#L20 assume !(~p <= 0); 330728#L21 assume ~q <= 0;#res := 0; 330722#partsFINAL assume true; 330717#partsEXIT >#69#return; 330715#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330712#partsFINAL assume true; 330707#partsEXIT >#67#return; 330704#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330705#$Ultimate##0 ~p := #in~p;~q := #in~q; 330714#L20 assume !(~p <= 0); 330711#L21 assume ~q <= 0;#res := 0; 330706#partsFINAL assume true; 330703#partsEXIT >#69#return; 330700#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330698#partsFINAL assume true; 330684#partsEXIT >#71#return; 330681#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330679#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330228#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330229#$Ultimate##0 ~p := #in~p;~q := #in~q; 330665#L20 assume !(~p <= 0); 330660#L21 assume !(~q <= 0); 330661#L22 assume !(~q > ~p); 330770#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330774#$Ultimate##0 ~p := #in~p;~q := #in~q; 330841#L20 assume ~p <= 0;#res := 1; 330775#partsFINAL assume true; 330769#partsEXIT >#67#return; 330773#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330819#$Ultimate##0 ~p := #in~p;~q := #in~q; 330915#L20 assume !(~p <= 0); 330914#L21 assume !(~q <= 0); 330911#L22 assume !(~q > ~p); 330834#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330839#$Ultimate##0 ~p := #in~p;~q := #in~q; 331096#L20 assume !(~p <= 0); 331094#L21 assume !(~q <= 0); 331095#L22 assume !(~q > ~p); 331098#L23 call #t~ret1 := parts(~p - ~q, ~q);< 331101#$Ultimate##0 ~p := #in~p;~q := #in~q; 331104#L20 assume ~p <= 0;#res := 1; 331102#partsFINAL assume true; 331097#partsEXIT >#67#return; 330893#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330898#$Ultimate##0 ~p := #in~p;~q := #in~q; 330908#L20 assume !(~p <= 0); 330907#L21 assume ~q <= 0;#res := 0; 330904#partsFINAL assume true; 330892#partsEXIT >#69#return; 330889#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330885#partsFINAL assume true; 330849#partsEXIT >#67#return; 330854#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 331006#$Ultimate##0 ~p := #in~p;~q := #in~q; 331014#L20 assume !(~p <= 0); 331012#L21 assume ~q <= 0;#res := 0; 331007#partsFINAL assume true; 331004#partsEXIT >#69#return; 331002#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 331001#partsFINAL assume true; 330987#partsEXIT >#69#return; 330984#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330983#partsFINAL assume true; 330957#partsEXIT >#71#return; 330958#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 330206#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 330207#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 330230#$Ultimate##0 ~p := #in~p;~q := #in~q; 330598#L20 assume !(~p <= 0); 330596#L21 assume !(~q <= 0); 330381#L22 assume ~q > ~p; 330273#L22-1 call #t~ret0 := parts(~p, ~p);< 330277#$Ultimate##0 ~p := #in~p;~q := #in~q; 330403#L20 assume !(~p <= 0); 330401#L21 assume !(~q <= 0); 330399#L22 assume !(~q > ~p); 330392#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330261#$Ultimate##0 ~p := #in~p;~q := #in~q; 330451#L20 assume ~p <= 0;#res := 1; 330398#partsFINAL assume true; 330391#partsEXIT >#67#return; 330383#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330387#$Ultimate##0 ~p := #in~p;~q := #in~q; 330429#L20 assume !(~p <= 0); 330422#L21 assume !(~q <= 0); 330419#L22 assume !(~q > ~p); 330412#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330414#$Ultimate##0 ~p := #in~p;~q := #in~q; 330668#L20 assume !(~p <= 0); 330666#L21 assume !(~q <= 0); 330667#L22 assume !(~q > ~p); 330455#L23 call #t~ret1 := parts(~p - ~q, ~q);< 330692#$Ultimate##0 ~p := #in~p;~q := #in~q; 330697#L20 assume ~p <= 0;#res := 1; 330691#partsFINAL assume true; 330454#partsEXIT >#67#return; 330424#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330428#$Ultimate##0 ~p := #in~p;~q := #in~q; 330438#L20 assume !(~p <= 0); 330431#L21 assume ~q <= 0;#res := 0; 330430#partsFINAL assume true; 330423#partsEXIT >#69#return; 330421#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330416#partsFINAL assume true; 330410#partsEXIT >#67#return; 330406#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 330407#$Ultimate##0 ~p := #in~p;~q := #in~q; 330420#L20 assume !(~p <= 0); 330415#L21 assume ~q <= 0;#res := 0; 330409#partsFINAL assume true; 330405#partsEXIT >#69#return; 330396#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330389#partsFINAL assume true; 330382#partsEXIT >#69#return; 330380#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 330282#partsFINAL assume true; 330283#partsEXIT >#65#return; 330995#L22-2 #res := #t~ret0;havoc #t~ret0; 330991#partsFINAL assume true; 330986#partsEXIT >#71#return; 330185#L36-1 [2024-10-13 16:58:24,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 10 times [2024-10-13 16:58:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865795574] [2024-10-13 16:58:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:24,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:24,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:24,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 96365960, now seen corresponding path program 6 times [2024-10-13 16:58:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:24,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143932953] [2024-10-13 16:58:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 16:58:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 16:58:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 16:58:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 110 proven. 373 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2024-10-13 16:58:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143932953] [2024-10-13 16:58:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143932953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324907169] [2024-10-13 16:58:25,042 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:58:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:25,054 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:25,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2024-10-13 16:58:25,159 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-13 16:58:25,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:25,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:58:25,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 787 proven. 198 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-13 16:58:25,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 149 proven. 479 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-13 16:58:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324907169] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:26,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:26,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 39 [2024-10-13 16:58:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221603150] [2024-10-13 16:58:26,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:26,202 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-13 16:58:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 16:58:26,203 INFO L87 Difference]: Start difference. First operand 2065 states and 2511 transitions. cyclomatic complexity: 461 Second operand has 39 states, 34 states have (on average 3.235294117647059) internal successors, (110), 33 states have internal predecessors, (110), 26 states have call successors, (37), 2 states have call predecessors, (37), 12 states have return successors, (39), 21 states have call predecessors, (39), 26 states have call successors, (39) [2024-10-13 16:58:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:28,225 INFO L93 Difference]: Finished difference Result 2598 states and 3207 transitions. [2024-10-13 16:58:28,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2598 states and 3207 transitions. [2024-10-13 16:58:28,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:28,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2598 states to 1343 states and 1567 transitions. [2024-10-13 16:58:28,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2024-10-13 16:58:28,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2024-10-13 16:58:28,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1343 states and 1567 transitions. [2024-10-13 16:58:28,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:28,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1343 states and 1567 transitions. [2024-10-13 16:58:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states and 1567 transitions. [2024-10-13 16:58:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1161. [2024-10-13 16:58:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 807 states have (on average 1.033457249070632) internal successors, (834), 824 states have internal predecessors, (834), 197 states have call successors, (213), 146 states have call predecessors, (213), 157 states have return successors, (280), 190 states have call predecessors, (280), 197 states have call successors, (280) [2024-10-13 16:58:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1327 transitions. [2024-10-13 16:58:28,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1161 states and 1327 transitions. [2024-10-13 16:58:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-13 16:58:28,258 INFO L425 stractBuchiCegarLoop]: Abstraction has 1161 states and 1327 transitions. [2024-10-13 16:58:28,258 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-13 16:58:28,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1161 states and 1327 transitions. [2024-10-13 16:58:28,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:28,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:28,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:28,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:28,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [53, 53, 42, 26, 22, 22, 22, 22, 22, 22, 16, 11, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-13 16:58:28,263 INFO L745 eck$LassoCheckResult]: Stem: 336387#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 336344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 336345#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 336338#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 336339#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 336398#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336446#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336447#$Ultimate##0 ~p := #in~p;~q := #in~q; 336449#L20 assume ~p <= 0;#res := 1; 336448#partsFINAL assume true; 336445#partsEXIT >#71#return; 336444#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336442#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336439#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336440#$Ultimate##0 ~p := #in~p;~q := #in~q; 336443#L20 assume ~p <= 0;#res := 1; 336441#partsFINAL assume true; 336438#partsEXIT >#71#return; 336437#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336435#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336433#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336429#$Ultimate##0 ~p := #in~p;~q := #in~q; 336436#L20 assume ~p <= 0;#res := 1; 336434#partsFINAL assume true; 336432#partsEXIT >#71#return; 336431#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336430#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336424#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336428#$Ultimate##0 ~p := #in~p;~q := #in~q; 336423#L20 assume ~p <= 0;#res := 1; 336425#partsFINAL assume true; 336450#partsEXIT >#71#return; 336402#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336401#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 336360#L35-3 havoc main_~q~0#1; 336361#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 336399#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 336400#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336682#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336683#$Ultimate##0 ~p := #in~p;~q := #in~q; 336693#L20 assume !(~p <= 0); 336691#L21 assume ~q <= 0;#res := 0; 336686#partsFINAL assume true; 336681#partsEXIT >#71#return; 336680#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336679#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336657#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336658#$Ultimate##0 ~p := #in~p;~q := #in~q; 336692#L20 assume !(~p <= 0); 336690#L21 assume !(~q <= 0); 336685#L22 assume !(~q > ~p); 336673#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336674#$Ultimate##0 ~p := #in~p;~q := #in~q; 336678#L20 assume ~p <= 0;#res := 1; 336676#partsFINAL assume true; 336672#partsEXIT >#67#return; 336669#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336670#$Ultimate##0 ~p := #in~p;~q := #in~q; 336677#L20 assume !(~p <= 0); 336675#L21 assume ~q <= 0;#res := 0; 336671#partsFINAL assume true; 336668#partsEXIT >#69#return; 336665#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336662#partsFINAL assume true; 336656#partsEXIT >#71#return; 336652#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336653#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336932#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336415#$Ultimate##0 ~p := #in~p;~q := #in~q; 337458#L20 assume !(~p <= 0); 337454#L21 assume !(~q <= 0); 337360#L22 assume ~q > ~p; 336366#L22-1 call #t~ret0 := parts(~p, ~p);< 337451#$Ultimate##0 ~p := #in~p;~q := #in~q; 337405#L20 assume !(~p <= 0); 337406#L21 assume !(~q <= 0); 337394#L22 assume !(~q > ~p); 337182#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337462#$Ultimate##0 ~p := #in~p;~q := #in~q; 337467#L20 assume ~p <= 0;#res := 1; 337466#partsFINAL assume true; 337461#partsEXIT >#67#return; 337456#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337457#$Ultimate##0 ~p := #in~p;~q := #in~q; 337468#L20 assume !(~p <= 0); 337463#L21 assume ~q <= 0;#res := 0; 337459#partsFINAL assume true; 337455#partsEXIT >#69#return; 337453#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337452#partsFINAL assume true; 337450#partsEXIT >#65#return; 337449#L22-2 #res := #t~ret0;havoc #t~ret0; 337447#partsFINAL assume true; 336931#partsEXIT >#71#return; 336933#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337164#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336412#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336414#$Ultimate##0 ~p := #in~p;~q := #in~q; 337284#L20 assume !(~p <= 0); 337283#L21 assume !(~q <= 0); 337282#L22 assume ~q > ~p; 336820#L22-1 call #t~ret0 := parts(~p, ~p);< 337281#$Ultimate##0 ~p := #in~p;~q := #in~q; 337302#L20 assume !(~p <= 0); 337301#L21 assume !(~q <= 0); 337300#L22 assume !(~q > ~p); 336823#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337299#$Ultimate##0 ~p := #in~p;~q := #in~q; 337304#L20 assume ~p <= 0;#res := 1; 337303#partsFINAL assume true; 337298#partsEXIT >#67#return; 337295#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337296#$Ultimate##0 ~p := #in~p;~q := #in~q; 337307#L20 assume !(~p <= 0); 337306#L21 assume ~q <= 0;#res := 0; 337305#partsFINAL assume true; 337294#partsEXIT >#69#return; 337292#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337290#partsFINAL assume true; 337280#partsEXIT >#65#return; 336722#L22-2 #res := #t~ret0;havoc #t~ret0; 336721#partsFINAL assume true; 336411#partsEXIT >#71#return; 336409#L36-1 [2024-10-13 16:58:28,264 INFO L747 eck$LassoCheckResult]: Loop: 336409#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336390#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 336359#L35-3 havoc main_~q~0#1; 336351#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 336352#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 336408#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336340#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336341#$Ultimate##0 ~p := #in~p;~q := #in~q; 336418#L20 assume !(~p <= 0); 336417#L21 assume ~q <= 0;#res := 0; 336416#partsFINAL assume true; 336410#partsEXIT >#71#return; 336394#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336391#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336392#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337008#$Ultimate##0 ~p := #in~p;~q := #in~q; 337266#L20 assume !(~p <= 0); 337265#L21 assume !(~q <= 0); 337264#L22 assume !(~q > ~p); 337029#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337030#$Ultimate##0 ~p := #in~p;~q := #in~q; 337393#L20 assume !(~p <= 0); 337361#L21 assume !(~q <= 0); 337239#L22 assume !(~q > ~p); 337049#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337051#$Ultimate##0 ~p := #in~p;~q := #in~q; 337118#L20 assume !(~p <= 0); 337114#L21 assume !(~q <= 0); 337111#L22 assume !(~q > ~p); 337112#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337121#$Ultimate##0 ~p := #in~p;~q := #in~q; 337125#L20 assume ~p <= 0;#res := 1; 337123#partsFINAL assume true; 337120#partsEXIT >#67#return; 337116#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337117#$Ultimate##0 ~p := #in~p;~q := #in~q; 337124#L20 assume !(~p <= 0); 337122#L21 assume ~q <= 0;#res := 0; 337119#partsFINAL assume true; 337115#partsEXIT >#69#return; 337113#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337109#partsFINAL assume true; 337107#partsEXIT >#67#return; 337103#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337105#$Ultimate##0 ~p := #in~p;~q := #in~q; 337136#L20 assume !(~p <= 0); 337129#L21 assume ~q <= 0;#res := 0; 337127#partsFINAL assume true; 337102#partsEXIT >#69#return; 337101#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337100#partsFINAL assume true; 337099#partsEXIT >#67#return; 337014#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337015#$Ultimate##0 ~p := #in~p;~q := #in~q; 337023#L20 assume !(~p <= 0); 337021#L21 assume ~q <= 0;#res := 0; 337020#partsFINAL assume true; 337013#partsEXIT >#69#return; 337012#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337010#partsFINAL assume true; 337006#partsEXIT >#71#return; 337002#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336998#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336916#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336910#$Ultimate##0 ~p := #in~p;~q := #in~q; 336957#L20 assume !(~p <= 0); 336952#L21 assume !(~q <= 0); 336947#L22 assume !(~q > ~p); 336948#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337062#$Ultimate##0 ~p := #in~p;~q := #in~q; 337260#L20 assume !(~p <= 0); 337259#L21 assume !(~q <= 0); 337071#L22 assume ~q > ~p; 337068#L22-1 call #t~ret0 := parts(~p, ~p);< 337069#$Ultimate##0 ~p := #in~p;~q := #in~q; 337098#L20 assume !(~p <= 0); 337096#L21 assume !(~q <= 0); 337092#L22 assume !(~q > ~p); 337082#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337083#$Ultimate##0 ~p := #in~p;~q := #in~q; 337094#L20 assume ~p <= 0;#res := 1; 337090#partsFINAL assume true; 337081#partsEXIT >#67#return; 337077#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337078#$Ultimate##0 ~p := #in~p;~q := #in~q; 337093#L20 assume !(~p <= 0); 337089#L21 assume ~q <= 0;#res := 0; 337080#partsFINAL assume true; 337076#partsEXIT >#69#return; 337072#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337070#partsFINAL assume true; 337067#partsEXIT >#65#return; 337066#L22-2 #res := #t~ret0;havoc #t~ret0; 337064#partsFINAL assume true; 337059#partsEXIT >#67#return; 337033#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337057#$Ultimate##0 ~p := #in~p;~q := #in~q; 337297#L20 assume !(~p <= 0); 337293#L21 assume !(~q <= 0); 337291#L22 assume !(~q > ~p); 337287#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337289#$Ultimate##0 ~p := #in~p;~q := #in~q; 337329#L20 assume !(~p <= 0); 337328#L21 assume !(~q <= 0); 337326#L22 assume !(~q > ~p); 337322#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337338#$Ultimate##0 ~p := #in~p;~q := #in~q; 337336#L20 assume ~p <= 0;#res := 1; 337330#partsFINAL assume true; 337320#partsEXIT >#67#return; 337316#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337317#$Ultimate##0 ~p := #in~p;~q := #in~q; 337363#L20 assume !(~p <= 0); 337362#L21 assume !(~q <= 0); 337359#L22 assume !(~q > ~p); 337229#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337358#$Ultimate##0 ~p := #in~p;~q := #in~q; 337389#L20 assume !(~p <= 0); 337388#L21 assume !(~q <= 0); 337386#L22 assume !(~q > ~p); 337342#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337344#$Ultimate##0 ~p := #in~p;~q := #in~q; 337390#L20 assume ~p <= 0;#res := 1; 337384#partsFINAL assume true; 337340#partsEXIT >#67#return; 337209#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337212#$Ultimate##0 ~p := #in~p;~q := #in~q; 337236#L20 assume !(~p <= 0); 337233#L21 assume ~q <= 0;#res := 0; 337228#partsFINAL assume true; 337206#partsEXIT >#69#return; 337210#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337364#partsFINAL assume true; 337357#partsEXIT >#67#return; 337353#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337355#$Ultimate##0 ~p := #in~p;~q := #in~q; 337376#L20 assume !(~p <= 0); 337372#L21 assume ~q <= 0;#res := 0; 337370#partsFINAL assume true; 337351#partsEXIT >#69#return; 337347#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337345#partsFINAL assume true; 337346#partsEXIT >#69#return; 337310#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337308#partsFINAL assume true; 337285#partsEXIT >#67#return; 337132#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337135#$Ultimate##0 ~p := #in~p;~q := #in~q; 337263#L20 assume !(~p <= 0); 337262#L21 assume ~q <= 0;#res := 0; 337261#partsFINAL assume true; 337131#partsEXIT >#69#return; 337128#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337126#partsFINAL assume true; 337055#partsEXIT >#69#return; 337054#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337053#partsFINAL assume true; 337047#partsEXIT >#71#return; 337041#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337039#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336917#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336910#$Ultimate##0 ~p := #in~p;~q := #in~q; 336957#L20 assume !(~p <= 0); 336952#L21 assume !(~q <= 0); 336947#L22 assume !(~q > ~p); 336948#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337062#$Ultimate##0 ~p := #in~p;~q := #in~q; 337260#L20 assume !(~p <= 0); 337259#L21 assume !(~q <= 0); 337071#L22 assume ~q > ~p; 337068#L22-1 call #t~ret0 := parts(~p, ~p);< 337069#$Ultimate##0 ~p := #in~p;~q := #in~q; 337098#L20 assume !(~p <= 0); 337096#L21 assume !(~q <= 0); 337092#L22 assume !(~q > ~p); 337082#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337083#$Ultimate##0 ~p := #in~p;~q := #in~q; 337094#L20 assume ~p <= 0;#res := 1; 337090#partsFINAL assume true; 337081#partsEXIT >#67#return; 337077#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337078#$Ultimate##0 ~p := #in~p;~q := #in~q; 337093#L20 assume !(~p <= 0); 337089#L21 assume ~q <= 0;#res := 0; 337080#partsFINAL assume true; 337076#partsEXIT >#69#return; 337072#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337070#partsFINAL assume true; 337067#partsEXIT >#65#return; 337066#L22-2 #res := #t~ret0;havoc #t~ret0; 337064#partsFINAL assume true; 337059#partsEXIT >#67#return; 337033#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337057#$Ultimate##0 ~p := #in~p;~q := #in~q; 337297#L20 assume !(~p <= 0); 337293#L21 assume !(~q <= 0); 337291#L22 assume !(~q > ~p); 337287#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337289#$Ultimate##0 ~p := #in~p;~q := #in~q; 337329#L20 assume !(~p <= 0); 337328#L21 assume !(~q <= 0); 337326#L22 assume !(~q > ~p); 337322#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337338#$Ultimate##0 ~p := #in~p;~q := #in~q; 337336#L20 assume ~p <= 0;#res := 1; 337330#partsFINAL assume true; 337320#partsEXIT >#67#return; 337316#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337317#$Ultimate##0 ~p := #in~p;~q := #in~q; 337363#L20 assume !(~p <= 0); 337362#L21 assume !(~q <= 0); 337359#L22 assume !(~q > ~p); 337229#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337358#$Ultimate##0 ~p := #in~p;~q := #in~q; 337389#L20 assume !(~p <= 0); 337388#L21 assume !(~q <= 0); 337386#L22 assume !(~q > ~p); 337342#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337344#$Ultimate##0 ~p := #in~p;~q := #in~q; 337390#L20 assume ~p <= 0;#res := 1; 337384#partsFINAL assume true; 337340#partsEXIT >#67#return; 337209#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337212#$Ultimate##0 ~p := #in~p;~q := #in~q; 337236#L20 assume !(~p <= 0); 337233#L21 assume ~q <= 0;#res := 0; 337228#partsFINAL assume true; 337206#partsEXIT >#69#return; 337210#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337364#partsFINAL assume true; 337357#partsEXIT >#67#return; 337353#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337355#$Ultimate##0 ~p := #in~p;~q := #in~q; 337376#L20 assume !(~p <= 0); 337372#L21 assume ~q <= 0;#res := 0; 337370#partsFINAL assume true; 337351#partsEXIT >#69#return; 337347#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337345#partsFINAL assume true; 337346#partsEXIT >#69#return; 337310#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337308#partsFINAL assume true; 337285#partsEXIT >#67#return; 337132#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337135#$Ultimate##0 ~p := #in~p;~q := #in~q; 337263#L20 assume !(~p <= 0); 337262#L21 assume ~q <= 0;#res := 0; 337261#partsFINAL assume true; 337131#partsEXIT >#69#return; 337128#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337126#partsFINAL assume true; 337055#partsEXIT >#69#return; 337054#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337053#partsFINAL assume true; 337047#partsEXIT >#71#return; 336914#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 336913#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 336378#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 336909#$Ultimate##0 ~p := #in~p;~q := #in~q; 336939#L20 assume !(~p <= 0); 336896#L21 assume !(~q <= 0); 336897#L22 assume ~q > ~p; 336377#L22-1 call #t~ret0 := parts(~p, ~p);< 336379#$Ultimate##0 ~p := #in~p;~q := #in~q; 336876#L20 assume !(~p <= 0); 336888#L21 assume !(~q <= 0); 336886#L22 assume !(~q > ~p); 336883#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336884#$Ultimate##0 ~p := #in~p;~q := #in~q; 336887#L20 assume ~p <= 0;#res := 1; 336885#partsFINAL assume true; 336882#partsEXIT >#67#return; 336839#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336878#$Ultimate##0 ~p := #in~p;~q := #in~q; 336874#L20 assume !(~p <= 0); 336867#L21 assume !(~q <= 0); 336865#L22 assume !(~q > ~p); 336841#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336842#$Ultimate##0 ~p := #in~p;~q := #in~q; 336877#L20 assume !(~p <= 0); 336873#L21 assume !(~q <= 0); 336849#L22 assume ~q > ~p; 336846#L22-1 call #t~ret0 := parts(~p, ~p);< 336847#$Ultimate##0 ~p := #in~p;~q := #in~q; 336864#L20 assume !(~p <= 0); 336863#L21 assume !(~q <= 0); 336860#L22 assume !(~q > ~p); 336856#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336857#$Ultimate##0 ~p := #in~p;~q := #in~q; 336862#L20 assume ~p <= 0;#res := 1; 336859#partsFINAL assume true; 336855#partsEXIT >#67#return; 336852#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336853#$Ultimate##0 ~p := #in~p;~q := #in~q; 336861#L20 assume !(~p <= 0); 336858#L21 assume ~q <= 0;#res := 0; 336854#partsFINAL assume true; 336851#partsEXIT >#69#return; 336850#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336848#partsFINAL assume true; 336845#partsEXIT >#65#return; 336844#L22-2 #res := #t~ret0;havoc #t~ret0; 336843#partsFINAL assume true; 336840#partsEXIT >#67#return; 336834#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336838#$Ultimate##0 ~p := #in~p;~q := #in~q; 336837#L20 assume !(~p <= 0); 336836#L21 assume !(~q <= 0); 336835#L22 assume !(~q > ~p); 336347#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336833#$Ultimate##0 ~p := #in~p;~q := #in~q; 336832#L20 assume !(~p <= 0); 336831#L21 assume !(~q <= 0); 336828#L22 assume !(~q > ~p); 336346#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336348#$Ultimate##0 ~p := #in~p;~q := #in~q; 336872#L20 assume ~p <= 0;#res := 1; 336871#partsFINAL assume true; 336869#partsEXIT >#67#return; 336752#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336830#$Ultimate##0 ~p := #in~p;~q := #in~q; 336805#L20 assume !(~p <= 0); 336801#L21 assume !(~q <= 0); 336795#L22 assume !(~q > ~p); 336756#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336761#$Ultimate##0 ~p := #in~p;~q := #in~q; 336898#L20 assume !(~p <= 0); 336890#L21 assume !(~q <= 0); 336891#L22 assume !(~q > ~p); 336788#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336789#$Ultimate##0 ~p := #in~p;~q := #in~q; 336806#L20 assume ~p <= 0;#res := 1; 336796#partsFINAL assume true; 336798#partsEXIT >#67#return; 336771#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336775#$Ultimate##0 ~p := #in~p;~q := #in~q; 336792#L20 assume !(~p <= 0); 336790#L21 assume ~q <= 0;#res := 0; 336784#partsFINAL assume true; 336770#partsEXIT >#69#return; 336763#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336762#partsFINAL assume true; 336754#partsEXIT >#67#return; 336746#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336749#$Ultimate##0 ~p := #in~p;~q := #in~q; 336760#L20 assume !(~p <= 0); 336759#L21 assume ~q <= 0;#res := 0; 336751#partsFINAL assume true; 336745#partsEXIT >#69#return; 336748#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337487#partsFINAL assume true; 337486#partsEXIT >#69#return; 337484#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337483#partsFINAL assume true; 337482#partsEXIT >#67#return; 336373#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336372#$Ultimate##0 ~p := #in~p;~q := #in~q; 336374#L20 assume !(~p <= 0); 337410#L21 assume ~q <= 0;#res := 0; 337409#partsFINAL assume true; 336968#partsEXIT >#69#return; 336962#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336960#partsFINAL assume true; 336958#partsEXIT >#69#return; 336953#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336950#partsFINAL assume true; 336945#partsEXIT >#69#return; 336941#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336938#partsFINAL assume true; 336928#partsEXIT >#65#return; 336930#L22-2 #res := #t~ret0;havoc #t~ret0; 337052#partsFINAL assume true; 336907#partsEXIT >#71#return; 336409#L36-1 [2024-10-13 16:58:28,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 11 times [2024-10-13 16:58:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460496946] [2024-10-13 16:58:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:28,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:28,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:28,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1447268326, now seen corresponding path program 7 times [2024-10-13 16:58:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:28,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865721021] [2024-10-13 16:58:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 16:58:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 16:58:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 16:58:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 16:58:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 16:58:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-13 16:58:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 16:58:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7438 backedges. 317 proven. 898 refuted. 0 times theorem prover too weak. 6223 trivial. 0 not checked. [2024-10-13 16:58:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865721021] [2024-10-13 16:58:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865721021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928170213] [2024-10-13 16:58:28,971 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:58:28,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:28,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:28,973 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:28,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2024-10-13 16:58:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 16:58:29,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7438 backedges. 3923 proven. 371 refuted. 0 times theorem prover too weak. 3144 trivial. 0 not checked. [2024-10-13 16:58:29,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7438 backedges. 246 proven. 1514 refuted. 0 times theorem prover too weak. 5678 trivial. 0 not checked. [2024-10-13 16:58:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928170213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:30,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 22] total 37 [2024-10-13 16:58:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374515980] [2024-10-13 16:58:30,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:30,807 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:30,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 16:58:30,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 16:58:30,809 INFO L87 Difference]: Start difference. First operand 1161 states and 1327 transitions. cyclomatic complexity: 179 Second operand has 37 states, 34 states have (on average 3.0) internal successors, (102), 32 states have internal predecessors, (102), 25 states have call successors, (34), 2 states have call predecessors, (34), 10 states have return successors, (40), 18 states have call predecessors, (40), 25 states have call successors, (40) [2024-10-13 16:58:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:31,864 INFO L93 Difference]: Finished difference Result 1310 states and 1552 transitions. [2024-10-13 16:58:31,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 1552 transitions. [2024-10-13 16:58:31,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:31,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1283 states and 1510 transitions. [2024-10-13 16:58:31,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2024-10-13 16:58:31,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2024-10-13 16:58:31,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1283 states and 1510 transitions. [2024-10-13 16:58:31,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:31,872 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1283 states and 1510 transitions. [2024-10-13 16:58:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states and 1510 transitions. [2024-10-13 16:58:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1184. [2024-10-13 16:58:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 822 states have (on average 1.032846715328467) internal successors, (849), 839 states have internal predecessors, (849), 199 states have call successors, (215), 147 states have call predecessors, (215), 163 states have return successors, (302), 197 states have call predecessors, (302), 199 states have call successors, (302) [2024-10-13 16:58:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1366 transitions. [2024-10-13 16:58:31,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1184 states and 1366 transitions. [2024-10-13 16:58:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-13 16:58:31,889 INFO L425 stractBuchiCegarLoop]: Abstraction has 1184 states and 1366 transitions. [2024-10-13 16:58:31,889 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-13 16:58:31,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1184 states and 1366 transitions. [2024-10-13 16:58:31,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:31,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:31,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:31,895 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:31,895 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 40, 24, 20, 20, 20, 20, 20, 20, 16, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-13 16:58:31,895 INFO L745 eck$LassoCheckResult]: Stem: 342509#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 342473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 342474#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 342467#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 342468#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 342518#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342565#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342566#$Ultimate##0 ~p := #in~p;~q := #in~q; 342568#L20 assume ~p <= 0;#res := 1; 342567#partsFINAL assume true; 342564#partsEXIT >#71#return; 342563#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342561#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342558#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342559#$Ultimate##0 ~p := #in~p;~q := #in~q; 342562#L20 assume ~p <= 0;#res := 1; 342560#partsFINAL assume true; 342557#partsEXIT >#71#return; 342556#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342554#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342552#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342546#$Ultimate##0 ~p := #in~p;~q := #in~q; 342555#L20 assume ~p <= 0;#res := 1; 342553#partsFINAL assume true; 342551#partsEXIT >#71#return; 342548#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342547#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342533#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342545#$Ultimate##0 ~p := #in~p;~q := #in~q; 342542#L20 assume ~p <= 0;#res := 1; 342543#partsFINAL assume true; 342532#partsEXIT >#71#return; 342531#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342530#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 342492#L35-3 havoc main_~q~0#1; 342493#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 342665#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 342663#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342661#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342662#$Ultimate##0 ~p := #in~p;~q := #in~q; 342693#L20 assume !(~p <= 0); 342691#L21 assume ~q <= 0;#res := 0; 342689#partsFINAL assume true; 342660#partsEXIT >#71#return; 342656#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342654#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342651#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342652#$Ultimate##0 ~p := #in~p;~q := #in~q; 342714#L20 assume !(~p <= 0); 342713#L21 assume !(~q <= 0); 342711#L22 assume !(~q > ~p); 342707#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342708#$Ultimate##0 ~p := #in~p;~q := #in~q; 342712#L20 assume ~p <= 0;#res := 1; 342710#partsFINAL assume true; 342706#partsEXIT >#67#return; 342672#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342673#$Ultimate##0 ~p := #in~p;~q := #in~q; 342709#L20 assume !(~p <= 0); 342705#L21 assume ~q <= 0;#res := 0; 342704#partsFINAL assume true; 342671#partsEXIT >#69#return; 342669#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342668#partsFINAL assume true; 342650#partsEXIT >#71#return; 342646#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342513#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342471#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342472#$Ultimate##0 ~p := #in~p;~q := #in~q; 343470#L20 assume !(~p <= 0); 343468#L21 assume !(~q <= 0); 343467#L22 assume ~q > ~p; 343050#L22-1 call #t~ret0 := parts(~p, ~p);< 343465#$Ultimate##0 ~p := #in~p;~q := #in~q; 343490#L20 assume !(~p <= 0); 343488#L21 assume !(~q <= 0); 343486#L22 assume !(~q > ~p); 343427#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343484#$Ultimate##0 ~p := #in~p;~q := #in~q; 343493#L20 assume ~p <= 0;#res := 1; 343491#partsFINAL assume true; 343483#partsEXIT >#67#return; 343481#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343482#$Ultimate##0 ~p := #in~p;~q := #in~q; 343495#L20 assume !(~p <= 0); 343494#L21 assume ~q <= 0;#res := 0; 343492#partsFINAL assume true; 343480#partsEXIT >#69#return; 343479#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343477#partsFINAL assume true; 343464#partsEXIT >#65#return; 343462#L22-2 #res := #t~ret0;havoc #t~ret0; 343453#partsFINAL assume true; 343451#partsEXIT >#71#return; 343449#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 343447#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342524#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342525#$Ultimate##0 ~p := #in~p;~q := #in~q; 343514#L20 assume !(~p <= 0); 343512#L21 assume !(~q <= 0); 343511#L22 assume ~q > ~p; 342938#L22-1 call #t~ret0 := parts(~p, ~p);< 343510#$Ultimate##0 ~p := #in~p;~q := #in~q; 343523#L20 assume !(~p <= 0); 343522#L21 assume !(~q <= 0); 343521#L22 assume !(~q > ~p); 342942#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343520#$Ultimate##0 ~p := #in~p;~q := #in~q; 343526#L20 assume ~p <= 0;#res := 1; 343524#partsFINAL assume true; 343519#partsEXIT >#67#return; 343517#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343518#$Ultimate##0 ~p := #in~p;~q := #in~q; 343528#L20 assume !(~p <= 0); 343527#L21 assume ~q <= 0;#res := 0; 343525#partsFINAL assume true; 343516#partsEXIT >#69#return; 343515#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343513#partsFINAL assume true; 343509#partsEXIT >#65#return; 343508#L22-2 #res := #t~ret0;havoc #t~ret0; 343503#partsFINAL assume true; 343019#partsEXIT >#71#return; 342521#L36-1 [2024-10-13 16:58:31,896 INFO L747 eck$LassoCheckResult]: Loop: 342521#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342512#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 342491#L35-3 havoc main_~q~0#1; 342481#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 342482#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 342520#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342469#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342470#$Ultimate##0 ~p := #in~p;~q := #in~q; 342529#L20 assume !(~p <= 0); 342528#L21 assume ~q <= 0;#res := 0; 342527#partsFINAL assume true; 342526#partsEXIT >#71#return; 342514#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342515#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 343151#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 343152#$Ultimate##0 ~p := #in~p;~q := #in~q; 343220#L20 assume !(~p <= 0); 343216#L21 assume !(~q <= 0); 343207#L22 assume !(~q > ~p); 343161#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343162#$Ultimate##0 ~p := #in~p;~q := #in~q; 343195#L20 assume !(~p <= 0); 343194#L21 assume !(~q <= 0); 343193#L22 assume !(~q > ~p); 343184#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343187#$Ultimate##0 ~p := #in~p;~q := #in~q; 343192#L20 assume !(~p <= 0); 343190#L21 assume !(~q <= 0); 343188#L22 assume !(~q > ~p); 343189#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343201#$Ultimate##0 ~p := #in~p;~q := #in~q; 343206#L20 assume ~p <= 0;#res := 1; 343204#partsFINAL assume true; 343200#partsEXIT >#67#return; 343198#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343199#$Ultimate##0 ~p := #in~p;~q := #in~q; 343219#L20 assume !(~p <= 0); 343215#L21 assume ~q <= 0;#res := 0; 343214#partsFINAL assume true; 343197#partsEXIT >#69#return; 343196#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343191#partsFINAL assume true; 343186#partsEXIT >#67#return; 343177#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343179#$Ultimate##0 ~p := #in~p;~q := #in~q; 343211#L20 assume !(~p <= 0); 343209#L21 assume ~q <= 0;#res := 0; 343183#partsFINAL assume true; 343175#partsEXIT >#69#return; 343173#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343171#partsFINAL assume true; 343160#partsEXIT >#67#return; 343157#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343158#$Ultimate##0 ~p := #in~p;~q := #in~q; 343174#L20 assume !(~p <= 0); 343172#L21 assume ~q <= 0;#res := 0; 343163#partsFINAL assume true; 343156#partsEXIT >#69#return; 343155#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343154#partsFINAL assume true; 343150#partsEXIT >#71#return; 343147#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 343145#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342489#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342498#$Ultimate##0 ~p := #in~p;~q := #in~q; 342499#L20 assume !(~p <= 0); 342496#L21 assume !(~q <= 0); 342488#L22 assume !(~q > ~p); 342490#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343096#$Ultimate##0 ~p := #in~p;~q := #in~q; 343129#L20 assume !(~p <= 0); 343125#L21 assume !(~q <= 0); 343122#L22 assume ~q > ~p; 343118#L22-1 call #t~ret0 := parts(~p, ~p);< 343119#$Ultimate##0 ~p := #in~p;~q := #in~q; 343140#L20 assume !(~p <= 0); 343139#L21 assume !(~q <= 0); 343136#L22 assume !(~q > ~p); 343132#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343133#$Ultimate##0 ~p := #in~p;~q := #in~q; 343138#L20 assume ~p <= 0;#res := 1; 343135#partsFINAL assume true; 343131#partsEXIT >#67#return; 343127#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343128#$Ultimate##0 ~p := #in~p;~q := #in~q; 343137#L20 assume !(~p <= 0); 343134#L21 assume ~q <= 0;#res := 0; 343130#partsFINAL assume true; 343126#partsEXIT >#69#return; 343124#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343121#partsFINAL assume true; 343117#partsEXIT >#65#return; 343108#L22-2 #res := #t~ret0;havoc #t~ret0; 343098#partsFINAL assume true; 343093#partsEXIT >#67#return; 343083#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343092#$Ultimate##0 ~p := #in~p;~q := #in~q; 343213#L20 assume !(~p <= 0); 343212#L21 assume !(~q <= 0); 343210#L22 assume !(~q > ~p); 343115#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343116#$Ultimate##0 ~p := #in~p;~q := #in~q; 343244#L20 assume !(~p <= 0); 343239#L21 assume !(~q <= 0); 343232#L22 assume !(~q > ~p); 342461#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343228#$Ultimate##0 ~p := #in~p;~q := #in~q; 343249#L20 assume !(~p <= 0); 343245#L21 assume !(~q <= 0); 343246#L22 assume !(~q > ~p); 343265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343267#$Ultimate##0 ~p := #in~p;~q := #in~q; 343272#L20 assume ~p <= 0;#res := 1; 343269#partsFINAL assume true; 343263#partsEXIT >#67#return; 343255#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343259#$Ultimate##0 ~p := #in~p;~q := #in~q; 343271#L20 assume !(~p <= 0); 343268#L21 assume ~q <= 0;#res := 0; 343260#partsFINAL assume true; 343253#partsEXIT >#69#return; 343251#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343248#partsFINAL assume true; 343227#partsEXIT >#67#return; 343224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343225#$Ultimate##0 ~p := #in~p;~q := #in~q; 343240#L20 assume !(~p <= 0); 343235#L21 assume ~q <= 0;#res := 0; 343229#partsFINAL assume true; 343222#partsEXIT >#69#return; 343221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343217#partsFINAL assume true; 343208#partsEXIT >#67#return; 343167#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343170#$Ultimate##0 ~p := #in~p;~q := #in~q; 343205#L20 assume !(~p <= 0); 343203#L21 assume ~q <= 0;#res := 0; 343202#partsFINAL assume true; 343164#partsEXIT >#69#return; 343159#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343153#partsFINAL assume true; 343148#partsEXIT >#69#return; 343146#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343144#partsFINAL assume true; 343143#partsEXIT >#71#return; 343142#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 343141#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 343034#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 343022#$Ultimate##0 ~p := #in~p;~q := #in~q; 343063#L20 assume !(~p <= 0); 343059#L21 assume !(~q <= 0); 343056#L22 assume !(~q > ~p); 342490#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343096#$Ultimate##0 ~p := #in~p;~q := #in~q; 343129#L20 assume !(~p <= 0); 343125#L21 assume !(~q <= 0); 343122#L22 assume ~q > ~p; 343118#L22-1 call #t~ret0 := parts(~p, ~p);< 343119#$Ultimate##0 ~p := #in~p;~q := #in~q; 343140#L20 assume !(~p <= 0); 343139#L21 assume !(~q <= 0); 343136#L22 assume !(~q > ~p); 343132#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343133#$Ultimate##0 ~p := #in~p;~q := #in~q; 343138#L20 assume ~p <= 0;#res := 1; 343135#partsFINAL assume true; 343131#partsEXIT >#67#return; 343127#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343128#$Ultimate##0 ~p := #in~p;~q := #in~q; 343137#L20 assume !(~p <= 0); 343134#L21 assume ~q <= 0;#res := 0; 343130#partsFINAL assume true; 343126#partsEXIT >#69#return; 343124#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343121#partsFINAL assume true; 343117#partsEXIT >#65#return; 343108#L22-2 #res := #t~ret0;havoc #t~ret0; 343098#partsFINAL assume true; 343093#partsEXIT >#67#return; 343083#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343092#$Ultimate##0 ~p := #in~p;~q := #in~q; 343213#L20 assume !(~p <= 0); 343212#L21 assume !(~q <= 0); 343210#L22 assume !(~q > ~p); 343115#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343116#$Ultimate##0 ~p := #in~p;~q := #in~q; 343244#L20 assume !(~p <= 0); 343239#L21 assume !(~q <= 0); 343232#L22 assume !(~q > ~p); 342461#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343228#$Ultimate##0 ~p := #in~p;~q := #in~q; 343249#L20 assume !(~p <= 0); 343245#L21 assume !(~q <= 0); 343246#L22 assume !(~q > ~p); 343265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 343267#$Ultimate##0 ~p := #in~p;~q := #in~q; 343272#L20 assume ~p <= 0;#res := 1; 343269#partsFINAL assume true; 343263#partsEXIT >#67#return; 343255#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343259#$Ultimate##0 ~p := #in~p;~q := #in~q; 343271#L20 assume !(~p <= 0); 343268#L21 assume ~q <= 0;#res := 0; 343260#partsFINAL assume true; 343253#partsEXIT >#69#return; 343251#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343248#partsFINAL assume true; 343227#partsEXIT >#67#return; 343224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343225#$Ultimate##0 ~p := #in~p;~q := #in~q; 343240#L20 assume !(~p <= 0); 343235#L21 assume ~q <= 0;#res := 0; 343229#partsFINAL assume true; 343222#partsEXIT >#69#return; 343221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343217#partsFINAL assume true; 343208#partsEXIT >#67#return; 343167#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343170#$Ultimate##0 ~p := #in~p;~q := #in~q; 343205#L20 assume !(~p <= 0); 343203#L21 assume ~q <= 0;#res := 0; 343202#partsFINAL assume true; 343164#partsEXIT >#69#return; 343159#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343153#partsFINAL assume true; 343148#partsEXIT >#69#return; 343146#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343144#partsFINAL assume true; 343143#partsEXIT >#71#return; 343030#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 343027#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342523#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 343023#$Ultimate##0 ~p := #in~p;~q := #in~q; 343043#L20 assume !(~p <= 0); 343040#L21 assume !(~q <= 0); 343032#L22 assume ~q > ~p; 342973#L22-1 call #t~ret0 := parts(~p, ~p);< 342987#$Ultimate##0 ~p := #in~p;~q := #in~q; 342986#L20 assume !(~p <= 0); 342984#L21 assume !(~q <= 0); 342982#L22 assume !(~q > ~p); 342979#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342980#$Ultimate##0 ~p := #in~p;~q := #in~q; 342996#L20 assume ~p <= 0;#res := 1; 342993#partsFINAL assume true; 342978#partsEXIT >#67#return; 342955#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342969#$Ultimate##0 ~p := #in~p;~q := #in~q; 342966#L20 assume !(~p <= 0); 342962#L21 assume !(~q <= 0); 342960#L22 assume !(~q > ~p); 342957#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342958#$Ultimate##0 ~p := #in~p;~q := #in~q; 342977#L20 assume !(~p <= 0); 342971#L21 assume !(~q <= 0); 342968#L22 assume ~q > ~p; 342964#L22-1 call #t~ret0 := parts(~p, ~p);< 342965#$Ultimate##0 ~p := #in~p;~q := #in~q; 342995#L20 assume !(~p <= 0); 342992#L21 assume !(~q <= 0); 342991#L22 assume !(~q > ~p); 342989#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342990#$Ultimate##0 ~p := #in~p;~q := #in~q; 342997#L20 assume ~p <= 0;#res := 1; 342994#partsFINAL assume true; 342988#partsEXIT >#67#return; 342975#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342976#$Ultimate##0 ~p := #in~p;~q := #in~q; 342985#L20 assume !(~p <= 0); 342983#L21 assume ~q <= 0;#res := 0; 342981#partsFINAL assume true; 342974#partsEXIT >#69#return; 342970#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342967#partsFINAL assume true; 342963#partsEXIT >#65#return; 342961#L22-2 #res := #t~ret0;havoc #t~ret0; 342959#partsFINAL assume true; 342956#partsEXIT >#67#return; 342950#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342954#$Ultimate##0 ~p := #in~p;~q := #in~q; 342953#L20 assume !(~p <= 0); 342952#L21 assume !(~q <= 0); 342951#L22 assume !(~q > ~p); 342476#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342949#$Ultimate##0 ~p := #in~p;~q := #in~q; 342948#L20 assume !(~p <= 0); 342947#L21 assume !(~q <= 0); 342926#L22 assume !(~q > ~p); 342475#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342477#$Ultimate##0 ~p := #in~p;~q := #in~q; 343006#L20 assume ~p <= 0;#res := 1; 343005#partsFINAL assume true; 343003#partsEXIT >#67#return; 342872#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342920#$Ultimate##0 ~p := #in~p;~q := #in~q; 342919#L20 assume !(~p <= 0); 342891#L21 assume !(~q <= 0); 342884#L22 assume !(~q > ~p); 342875#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342881#$Ultimate##0 ~p := #in~p;~q := #in~q; 343000#L20 assume !(~p <= 0); 342946#L21 assume !(~q <= 0); 342925#L22 assume !(~q > ~p); 342917#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342918#$Ultimate##0 ~p := #in~p;~q := #in~q; 342999#L20 assume ~p <= 0;#res := 1; 342924#partsFINAL assume true; 342916#partsEXIT >#67#return; 342887#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342890#$Ultimate##0 ~p := #in~p;~q := #in~q; 342902#L20 assume !(~p <= 0); 342901#L21 assume ~q <= 0;#res := 0; 342898#partsFINAL assume true; 342885#partsEXIT >#69#return; 342883#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342882#partsFINAL assume true; 342874#partsEXIT >#67#return; 342867#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342869#$Ultimate##0 ~p := #in~p;~q := #in~q; 342880#L20 assume !(~p <= 0); 342879#L21 assume ~q <= 0;#res := 0; 342871#partsFINAL assume true; 342865#partsEXIT >#69#return; 342868#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343638#partsFINAL assume true; 343637#partsEXIT >#69#return; 343635#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343634#partsFINAL assume true; 343625#partsEXIT >#67#return; 343588#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 343589#$Ultimate##0 ~p := #in~p;~q := #in~q; 343593#L20 assume !(~p <= 0); 343592#L21 assume ~q <= 0;#res := 0; 343590#partsFINAL assume true; 343587#partsEXIT >#69#return; 343581#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343580#partsFINAL assume true; 343566#partsEXIT >#69#return; 343343#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343297#partsFINAL assume true; 343042#partsEXIT >#69#return; 343039#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 343031#partsFINAL assume true; 343028#partsEXIT >#65#return; 343026#L22-2 #res := #t~ret0;havoc #t~ret0; 343025#partsFINAL assume true; 342522#partsEXIT >#71#return; 342521#L36-1 [2024-10-13 16:58:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 12 times [2024-10-13 16:58:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085827956] [2024-10-13 16:58:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:31,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:31,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:31,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1417033610, now seen corresponding path program 8 times [2024-10-13 16:58:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665723891] [2024-10-13 16:58:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 16:58:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 16:58:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 16:58:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 16:58:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:58:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-13 16:58:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:58:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:58:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:58:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:58:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 16:58:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 406 proven. 274 refuted. 0 times theorem prover too weak. 5697 trivial. 0 not checked. [2024-10-13 16:58:32,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665723891] [2024-10-13 16:58:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665723891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787835095] [2024-10-13 16:58:32,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:32,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:32,560 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2024-10-13 16:58:32,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:32,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:32,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 16:58:32,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 3176 proven. 611 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2024-10-13 16:58:33,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 234 proven. 1126 refuted. 0 times theorem prover too weak. 5017 trivial. 0 not checked. [2024-10-13 16:58:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787835095] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:34,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 19] total 35 [2024-10-13 16:58:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798325762] [2024-10-13 16:58:34,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:34,182 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 16:58:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 16:58:34,183 INFO L87 Difference]: Start difference. First operand 1184 states and 1366 transitions. cyclomatic complexity: 195 Second operand has 35 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 31 states have internal predecessors, (100), 25 states have call successors, (32), 2 states have call predecessors, (32), 10 states have return successors, (36), 16 states have call predecessors, (36), 25 states have call successors, (36) [2024-10-13 16:58:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:35,185 INFO L93 Difference]: Finished difference Result 1311 states and 1524 transitions. [2024-10-13 16:58:35,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1311 states and 1524 transitions. [2024-10-13 16:58:35,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-13 16:58:35,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1311 states to 1303 states and 1513 transitions. [2024-10-13 16:58:35,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2024-10-13 16:58:35,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2024-10-13 16:58:35,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1303 states and 1513 transitions. [2024-10-13 16:58:35,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:35,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1303 states and 1513 transitions. [2024-10-13 16:58:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states and 1513 transitions. [2024-10-13 16:58:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1185. [2024-10-13 16:58:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 825 states have (on average 1.0315151515151515) internal successors, (851), 841 states have internal predecessors, (851), 198 states have call successors, (214), 149 states have call predecessors, (214), 162 states have return successors, (281), 194 states have call predecessors, (281), 198 states have call successors, (281) [2024-10-13 16:58:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1346 transitions. [2024-10-13 16:58:35,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1185 states and 1346 transitions. [2024-10-13 16:58:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-13 16:58:35,206 INFO L425 stractBuchiCegarLoop]: Abstraction has 1185 states and 1346 transitions. [2024-10-13 16:58:35,206 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-13 16:58:35,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1185 states and 1346 transitions. [2024-10-13 16:58:35,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2024-10-13 16:58:35,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:35,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:35,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:35,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 41, 25, 21, 21, 21, 21, 21, 21, 16, 10, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-13 16:58:35,211 INFO L745 eck$LassoCheckResult]: Stem: 348351#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 348316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 348317#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 348311#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 348312#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 348366#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348412#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348413#$Ultimate##0 ~p := #in~p;~q := #in~q; 348415#L20 assume ~p <= 0;#res := 1; 348414#partsFINAL assume true; 348411#partsEXIT >#71#return; 348410#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348408#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348405#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348406#$Ultimate##0 ~p := #in~p;~q := #in~q; 348409#L20 assume ~p <= 0;#res := 1; 348407#partsFINAL assume true; 348404#partsEXIT >#71#return; 348403#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348401#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348399#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348395#$Ultimate##0 ~p := #in~p;~q := #in~q; 348402#L20 assume ~p <= 0;#res := 1; 348400#partsFINAL assume true; 348398#partsEXIT >#71#return; 348397#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348396#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348391#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348394#$Ultimate##0 ~p := #in~p;~q := #in~q; 348390#L20 assume ~p <= 0;#res := 1; 348392#partsFINAL assume true; 348416#partsEXIT >#71#return; 348417#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348591#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 348590#L35-3 havoc main_~q~0#1; 348326#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 348327#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 348571#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348564#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348565#$Ultimate##0 ~p := #in~p;~q := #in~q; 348609#L20 assume !(~p <= 0); 348602#L21 assume ~q <= 0;#res := 0; 348595#partsFINAL assume true; 348563#partsEXIT >#71#return; 348561#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348559#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348518#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348519#$Ultimate##0 ~p := #in~p;~q := #in~q; 348531#L20 assume !(~p <= 0); 348529#L21 assume !(~q <= 0); 348528#L22 assume !(~q > ~p); 348526#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348527#$Ultimate##0 ~p := #in~p;~q := #in~q; 348532#L20 assume ~p <= 0;#res := 1; 348530#partsFINAL assume true; 348525#partsEXIT >#67#return; 348523#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348524#$Ultimate##0 ~p := #in~p;~q := #in~q; 348543#L20 assume !(~p <= 0); 348538#L21 assume ~q <= 0;#res := 0; 348534#partsFINAL assume true; 348522#partsEXIT >#69#return; 348521#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348520#partsFINAL assume true; 348517#partsEXIT >#71#return; 348514#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348515#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348910#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348870#$Ultimate##0 ~p := #in~p;~q := #in~q; 349086#L20 assume !(~p <= 0); 349084#L21 assume !(~q <= 0); 349082#L22 assume ~q > ~p; 348922#L22-1 call #t~ret0 := parts(~p, ~p);< 349055#$Ultimate##0 ~p := #in~p;~q := #in~q; 349074#L20 assume !(~p <= 0); 349073#L21 assume !(~q <= 0); 349072#L22 assume !(~q > ~p); 348967#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349070#$Ultimate##0 ~p := #in~p;~q := #in~q; 349076#L20 assume ~p <= 0;#res := 1; 349075#partsFINAL assume true; 349069#partsEXIT >#67#return; 349066#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349067#$Ultimate##0 ~p := #in~p;~q := #in~q; 349080#L20 assume !(~p <= 0); 349078#L21 assume ~q <= 0;#res := 0; 349077#partsFINAL assume true; 349065#partsEXIT >#69#return; 349063#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349059#partsFINAL assume true; 349054#partsEXIT >#65#return; 349052#L22-2 #res := #t~ret0;havoc #t~ret0; 349049#partsFINAL assume true; 349041#partsEXIT >#71#return; 349038#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 349035#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348382#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348871#$Ultimate##0 ~p := #in~p;~q := #in~q; 348867#L20 assume !(~p <= 0); 348865#L21 assume !(~q <= 0); 348862#L22 assume ~q > ~p; 348797#L22-1 call #t~ret0 := parts(~p, ~p);< 348861#$Ultimate##0 ~p := #in~p;~q := #in~q; 348860#L20 assume !(~p <= 0); 348858#L21 assume !(~q <= 0); 348855#L22 assume !(~q > ~p); 348799#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349145#$Ultimate##0 ~p := #in~p;~q := #in~q; 349173#L20 assume ~p <= 0;#res := 1; 349172#partsFINAL assume true; 349144#partsEXIT >#67#return; 349141#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349142#$Ultimate##0 ~p := #in~p;~q := #in~q; 349176#L20 assume !(~p <= 0); 349175#L21 assume ~q <= 0;#res := 0; 349174#partsFINAL assume true; 349140#partsEXIT >#69#return; 349138#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349136#partsFINAL assume true; 349135#partsEXIT >#65#return; 348693#L22-2 #res := #t~ret0;havoc #t~ret0; 348694#partsFINAL assume true; 348381#partsEXIT >#71#return; 348372#L36-1 [2024-10-13 16:58:35,211 INFO L747 eck$LassoCheckResult]: Loop: 348372#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348352#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 348332#L35-3 havoc main_~q~0#1; 348324#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 348325#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 348369#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348313#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348314#$Ultimate##0 ~p := #in~p;~q := #in~q; 348380#L20 assume !(~p <= 0); 348379#L21 assume ~q <= 0;#res := 0; 348378#partsFINAL assume true; 348377#partsEXIT >#71#return; 348356#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348357#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 349239#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 349240#$Ultimate##0 ~p := #in~p;~q := #in~q; 349255#L20 assume !(~p <= 0); 349254#L21 assume !(~q <= 0); 349252#L22 assume !(~q > ~p); 349249#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349250#$Ultimate##0 ~p := #in~p;~q := #in~q; 349297#L20 assume !(~p <= 0); 349296#L21 assume !(~q <= 0); 349289#L22 assume !(~q > ~p); 349282#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349285#$Ultimate##0 ~p := #in~p;~q := #in~q; 349302#L20 assume !(~p <= 0); 349298#L21 assume !(~q <= 0); 349291#L22 assume !(~q > ~p); 349292#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349301#$Ultimate##0 ~p := #in~p;~q := #in~q; 349306#L20 assume ~p <= 0;#res := 1; 349304#partsFINAL assume true; 349300#partsEXIT >#67#return; 349294#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349295#$Ultimate##0 ~p := #in~p;~q := #in~q; 349305#L20 assume !(~p <= 0); 349303#L21 assume ~q <= 0;#res := 0; 349299#partsFINAL assume true; 349293#partsEXIT >#69#return; 349288#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349287#partsFINAL assume true; 349284#partsEXIT >#67#return; 349277#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349280#$Ultimate##0 ~p := #in~p;~q := #in~q; 349290#L20 assume !(~p <= 0); 349286#L21 assume ~q <= 0;#res := 0; 349281#partsFINAL assume true; 349276#partsEXIT >#69#return; 349275#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349273#partsFINAL assume true; 349271#partsEXIT >#67#return; 349268#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349269#$Ultimate##0 ~p := #in~p;~q := #in~q; 349274#L20 assume !(~p <= 0); 349272#L21 assume ~q <= 0;#res := 0; 349270#partsFINAL assume true; 349267#partsEXIT >#69#return; 349266#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349265#partsFINAL assume true; 349264#partsEXIT >#71#return; 349263#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 349262#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 349205#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 349261#$Ultimate##0 ~p := #in~p;~q := #in~q; 349260#L20 assume !(~p <= 0); 349259#L21 assume !(~q <= 0); 349258#L22 assume !(~q > ~p); 349113#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349209#$Ultimate##0 ~p := #in~p;~q := #in~q; 349316#L20 assume !(~p <= 0); 349256#L21 assume !(~q <= 0); 349219#L22 assume ~q > ~p; 349215#L22-1 call #t~ret0 := parts(~p, ~p);< 349216#$Ultimate##0 ~p := #in~p;~q := #in~q; 349241#L20 assume !(~p <= 0); 349237#L21 assume !(~q <= 0); 349233#L22 assume !(~q > ~p); 349228#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349229#$Ultimate##0 ~p := #in~p;~q := #in~q; 349236#L20 assume ~p <= 0;#res := 1; 349232#partsFINAL assume true; 349227#partsEXIT >#67#return; 349224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349225#$Ultimate##0 ~p := #in~p;~q := #in~q; 349235#L20 assume !(~p <= 0); 349231#L21 assume ~q <= 0;#res := 0; 349226#partsFINAL assume true; 349223#partsEXIT >#69#return; 349221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349218#partsFINAL assume true; 349214#partsEXIT >#65#return; 349212#L22-2 #res := #t~ret0;havoc #t~ret0; 349210#partsFINAL assume true; 349206#partsEXIT >#67#return; 349186#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349204#$Ultimate##0 ~p := #in~p;~q := #in~q; 349203#L20 assume !(~p <= 0); 349202#L21 assume !(~q <= 0); 349201#L22 assume !(~q > ~p); 349195#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349197#$Ultimate##0 ~p := #in~p;~q := #in~q; 349400#L20 assume !(~p <= 0); 349397#L21 assume !(~q <= 0); 349394#L22 assume !(~q > ~p); 348344#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349364#$Ultimate##0 ~p := #in~p;~q := #in~q; 349399#L20 assume !(~p <= 0); 349395#L21 assume !(~q <= 0); 349396#L22 assume !(~q > ~p); 349375#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349376#$Ultimate##0 ~p := #in~p;~q := #in~q; 349391#L20 assume ~p <= 0;#res := 1; 349387#partsFINAL assume true; 349372#partsEXIT >#67#return; 349020#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349023#$Ultimate##0 ~p := #in~p;~q := #in~q; 349033#L20 assume !(~p <= 0); 349031#L21 assume ~q <= 0;#res := 0; 349029#partsFINAL assume true; 349017#partsEXIT >#69#return; 349021#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349386#partsFINAL assume true; 349363#partsEXIT >#67#return; 349327#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349352#$Ultimate##0 ~p := #in~p;~q := #in~q; 349346#L20 assume !(~p <= 0); 349339#L21 assume ~q <= 0;#res := 0; 349340#partsFINAL assume true; 349325#partsEXIT >#69#return; 349328#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349317#partsFINAL assume true; 349318#partsEXIT >#67#return; 349179#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349184#$Ultimate##0 ~p := #in~p;~q := #in~q; 349188#L20 assume !(~p <= 0); 349187#L21 assume ~q <= 0;#res := 0; 349185#partsFINAL assume true; 349178#partsEXIT >#69#return; 349182#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349471#partsFINAL assume true; 349470#partsEXIT >#69#return; 349469#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349468#partsFINAL assume true; 349465#partsEXIT >#71#return; 349466#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 349472#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348300#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348315#$Ultimate##0 ~p := #in~p;~q := #in~q; 348340#L20 assume !(~p <= 0); 349104#L21 assume !(~q <= 0); 349103#L22 assume !(~q > ~p); 349101#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349093#$Ultimate##0 ~p := #in~p;~q := #in~q; 349107#L20 assume ~p <= 0;#res := 1; 349105#partsFINAL assume true; 349100#partsEXIT >#67#return; 348937#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348941#$Ultimate##0 ~p := #in~p;~q := #in~q; 349102#L20 assume !(~p <= 0); 349099#L21 assume !(~q <= 0); 348983#L22 assume !(~q > ~p); 348976#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348978#$Ultimate##0 ~p := #in~p;~q := #in~q; 349048#L20 assume !(~p <= 0); 349047#L21 assume !(~q <= 0); 349046#L22 assume ~q > ~p; 349044#L22-1 call #t~ret0 := parts(~p, ~p);< 349045#$Ultimate##0 ~p := #in~p;~q := #in~q; 349071#L20 assume !(~p <= 0); 349068#L21 assume !(~q <= 0); 349064#L22 assume !(~q > ~p); 349061#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349062#$Ultimate##0 ~p := #in~p;~q := #in~q; 349081#L20 assume ~p <= 0;#res := 1; 349079#partsFINAL assume true; 349060#partsEXIT >#67#return; 349057#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349058#$Ultimate##0 ~p := #in~p;~q := #in~q; 349087#L20 assume !(~p <= 0); 349085#L21 assume ~q <= 0;#res := 0; 349083#partsFINAL assume true; 349056#partsEXIT >#69#return; 349053#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349051#partsFINAL assume true; 349043#partsEXIT >#65#return; 349039#L22-2 #res := #t~ret0;havoc #t~ret0; 349036#partsFINAL assume true; 348975#partsEXIT >#67#return; 348971#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348973#$Ultimate##0 ~p := #in~p;~q := #in~q; 349200#L20 assume !(~p <= 0); 349199#L21 assume !(~q <= 0); 349198#L22 assume !(~q > ~p); 349194#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349197#$Ultimate##0 ~p := #in~p;~q := #in~q; 349400#L20 assume !(~p <= 0); 349397#L21 assume !(~q <= 0); 349394#L22 assume !(~q > ~p); 348344#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349364#$Ultimate##0 ~p := #in~p;~q := #in~q; 349399#L20 assume !(~p <= 0); 349395#L21 assume !(~q <= 0); 349396#L22 assume !(~q > ~p); 349375#L23 call #t~ret1 := parts(~p - ~q, ~q);< 349376#$Ultimate##0 ~p := #in~p;~q := #in~q; 349391#L20 assume ~p <= 0;#res := 1; 349387#partsFINAL assume true; 349372#partsEXIT >#67#return; 349020#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349023#$Ultimate##0 ~p := #in~p;~q := #in~q; 349033#L20 assume !(~p <= 0); 349031#L21 assume ~q <= 0;#res := 0; 349029#partsFINAL assume true; 349017#partsEXIT >#69#return; 349021#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349386#partsFINAL assume true; 349363#partsEXIT >#67#return; 349327#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349352#$Ultimate##0 ~p := #in~p;~q := #in~q; 349346#L20 assume !(~p <= 0); 349339#L21 assume ~q <= 0;#res := 0; 349340#partsFINAL assume true; 349325#partsEXIT >#69#return; 349328#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349317#partsFINAL assume true; 349318#partsEXIT >#67#return; 349180#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349184#$Ultimate##0 ~p := #in~p;~q := #in~q; 349188#L20 assume !(~p <= 0); 349187#L21 assume ~q <= 0;#res := 0; 349185#partsFINAL assume true; 349178#partsEXIT >#69#return; 349106#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349098#partsFINAL assume true; 348981#partsEXIT >#69#return; 348979#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348974#partsFINAL assume true; 348942#partsEXIT >#69#return; 348943#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349454#partsFINAL assume true; 349455#partsEXIT >#71#return; 348306#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348894#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348301#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348874#$Ultimate##0 ~p := #in~p;~q := #in~q; 348888#L20 assume !(~p <= 0); 348886#L21 assume !(~q <= 0); 348884#L22 assume ~q > ~p; 348829#L22-1 call #t~ret0 := parts(~p, ~p);< 348853#$Ultimate##0 ~p := #in~p;~q := #in~q; 348851#L20 assume !(~p <= 0); 348848#L21 assume !(~q <= 0); 348844#L22 assume !(~q > ~p); 348835#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348836#$Ultimate##0 ~p := #in~p;~q := #in~q; 348846#L20 assume ~p <= 0;#res := 1; 348843#partsFINAL assume true; 348834#partsEXIT >#67#return; 348811#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348825#$Ultimate##0 ~p := #in~p;~q := #in~q; 348822#L20 assume !(~p <= 0); 348818#L21 assume !(~q <= 0); 348816#L22 assume !(~q > ~p); 348813#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348814#$Ultimate##0 ~p := #in~p;~q := #in~q; 348833#L20 assume !(~p <= 0); 348827#L21 assume !(~q <= 0); 348824#L22 assume ~q > ~p; 348820#L22-1 call #t~ret0 := parts(~p, ~p);< 348821#$Ultimate##0 ~p := #in~p;~q := #in~q; 348852#L20 assume !(~p <= 0); 348850#L21 assume !(~q <= 0); 348847#L22 assume !(~q > ~p); 348840#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348841#$Ultimate##0 ~p := #in~p;~q := #in~q; 348849#L20 assume ~p <= 0;#res := 1; 348845#partsFINAL assume true; 348839#partsEXIT >#67#return; 348831#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348832#$Ultimate##0 ~p := #in~p;~q := #in~q; 348842#L20 assume !(~p <= 0); 348838#L21 assume ~q <= 0;#res := 0; 348837#partsFINAL assume true; 348830#partsEXIT >#69#return; 348826#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348823#partsFINAL assume true; 348819#partsEXIT >#65#return; 348817#L22-2 #res := #t~ret0;havoc #t~ret0; 348815#partsFINAL assume true; 348812#partsEXIT >#67#return; 348806#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348810#$Ultimate##0 ~p := #in~p;~q := #in~q; 348809#L20 assume !(~p <= 0); 348808#L21 assume !(~q <= 0); 348807#L22 assume !(~q > ~p); 348699#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348805#$Ultimate##0 ~p := #in~p;~q := #in~q; 348804#L20 assume !(~p <= 0); 348802#L21 assume !(~q <= 0); 348803#L22 assume !(~q > ~p); 348781#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348783#$Ultimate##0 ~p := #in~p;~q := #in~q; 348785#L20 assume ~p <= 0;#res := 1; 348784#partsFINAL assume true; 348780#partsEXIT >#67#return; 348725#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348742#$Ultimate##0 ~p := #in~p;~q := #in~q; 348739#L20 assume !(~p <= 0); 348736#L21 assume !(~q <= 0); 348735#L22 assume !(~q > ~p); 348728#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348733#$Ultimate##0 ~p := #in~p;~q := #in~q; 349169#L20 assume !(~p <= 0); 349168#L21 assume !(~q <= 0); 349167#L22 assume !(~q > ~p); 348760#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348778#$Ultimate##0 ~p := #in~p;~q := #in~q; 348857#L20 assume ~p <= 0;#res := 1; 348854#partsFINAL assume true; 348758#partsEXIT >#67#return; 348745#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348748#$Ultimate##0 ~p := #in~p;~q := #in~q; 348767#L20 assume !(~p <= 0); 348764#L21 assume ~q <= 0;#res := 0; 348757#partsFINAL assume true; 348743#partsEXIT >#69#return; 348740#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348737#partsFINAL assume true; 348727#partsEXIT >#67#return; 348720#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348722#$Ultimate##0 ~p := #in~p;~q := #in~q; 348734#L20 assume !(~p <= 0); 348732#L21 assume ~q <= 0;#res := 0; 348724#partsFINAL assume true; 348718#partsEXIT >#69#return; 348721#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349478#partsFINAL assume true; 349477#partsEXIT >#69#return; 349475#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349474#partsFINAL assume true; 349462#partsEXIT >#67#return; 348362#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 349460#$Ultimate##0 ~p := #in~p;~q := #in~q; 348361#L20 assume !(~p <= 0); 348363#L21 assume ~q <= 0;#res := 0; 349461#partsFINAL assume true; 349459#partsEXIT >#69#return; 349457#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 349407#partsFINAL assume true; 348891#partsEXIT >#69#return; 348890#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348889#partsFINAL assume true; 348887#partsEXIT >#69#return; 348885#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348883#partsFINAL assume true; 348880#partsEXIT >#65#return; 348879#L22-2 #res := #t~ret0;havoc #t~ret0; 348878#partsFINAL assume true; 348872#partsEXIT >#71#return; 348372#L36-1 [2024-10-13 16:58:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 13 times [2024-10-13 16:58:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:35,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85831662] [2024-10-13 16:58:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:35,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:35,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash 471736268, now seen corresponding path program 9 times [2024-10-13 16:58:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377373652] [2024-10-13 16:58:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat