./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:13:56,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:13:56,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:13:56,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:13:56,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:13:57,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:13:57,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:13:57,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:13:57,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:13:57,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:13:57,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:13:57,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:13:57,020 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:13:57,020 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:13:57,021 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:13:57,021 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:13:57,021 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:13:57,021 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:13:57,021 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:13:57,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:13:57,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:13:57,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:13:57,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:13:57,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:13:57,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:13:57,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:13:57,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:13:57,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:13:57,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:13:57,025 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:13:57,025 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2024-10-12 00:13:57,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:13:57,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:13:57,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:13:57,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:13:57,245 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:13:57,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2024-10-12 00:13:58,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:13:58,633 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:13:58,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2024-10-12 00:13:58,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3df64bb7a/f8cd168b50464c4eb63c2113c14d2138/FLAGc85e9e36d [2024-10-12 00:13:58,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3df64bb7a/f8cd168b50464c4eb63c2113c14d2138 [2024-10-12 00:13:58,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:13:58,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:13:58,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:13:58,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:13:58,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:13:58,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322ba77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58, skipping insertion in model container [2024-10-12 00:13:58,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:13:58,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:13:58,859 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:13:58,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:13:58,878 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:13:58,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58 WrapperNode [2024-10-12 00:13:58,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:13:58,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:13:58,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:13:58,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:13:58,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,899 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-10-12 00:13:58,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:13:58,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:13:58,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:13:58,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:13:58,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,914 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-12 00:13:58,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:13:58,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:13:58,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:13:58,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:13:58,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (1/1) ... [2024-10-12 00:13:58,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:58,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:58,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:58,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:13:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2024-10-12 00:13:58,994 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2024-10-12 00:13:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:13:58,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:13:59,038 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:13:59,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:13:59,134 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-12 00:13:59,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:13:59,143 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:13:59,143 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:13:59,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:13:59 BoogieIcfgContainer [2024-10-12 00:13:59,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:13:59,144 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:13:59,144 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:13:59,147 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:13:59,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:13:59,148 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:13:58" (1/3) ... [2024-10-12 00:13:59,148 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21b6a38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:13:59, skipping insertion in model container [2024-10-12 00:13:59,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:13:59,148 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:58" (2/3) ... [2024-10-12 00:13:59,149 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21b6a38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:13:59, skipping insertion in model container [2024-10-12 00:13:59,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:13:59,149 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:13:59" (3/3) ... [2024-10-12 00:13:59,150 INFO L332 chiAutomizerObserver]: Analyzing ICFG Parts.c [2024-10-12 00:13:59,204 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:13:59,204 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:13:59,205 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:13:59,205 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:13:59,205 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:13:59,205 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:13:59,205 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:13:59,205 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:13:59,209 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-12 00:13:59,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:13:59,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:59,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:59,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:59,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:13:59,231 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:13:59,231 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-12 00:13:59,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:13:59,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:59,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:59,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:59,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:13:59,241 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-12 00:13:59,241 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-12 00:13:59,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2024-10-12 00:13:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50964029] [2024-10-12 00:13:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2137072, now seen corresponding path program 1 times [2024-10-12 00:13:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901373051] [2024-10-12 00:13:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:13:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901373051] [2024-10-12 00:13:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901373051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:13:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:13:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:13:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35904112] [2024-10-12 00:13:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:13:59,375 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:13:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:13:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:13:59,404 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-12 00:13:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:59,414 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2024-10-12 00:13:59,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2024-10-12 00:13:59,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:13:59,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 28 transitions. [2024-10-12 00:13:59,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:13:59,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:13:59,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2024-10-12 00:13:59,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:13:59,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 00:13:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2024-10-12 00:13:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-12 00:13:59,445 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-12 00:13:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-12 00:13:59,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 00:13:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:13:59,450 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 00:13:59,450 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:13:59,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2024-10-12 00:13:59,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:13:59,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:59,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:59,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:59,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:13:59,451 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-12 00:13:59,451 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-12 00:13:59,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2024-10-12 00:13:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715360705] [2024-10-12 00:13:59,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:59,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2130345, now seen corresponding path program 1 times [2024-10-12 00:13:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238093646] [2024-10-12 00:13:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:59,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash -821894448, now seen corresponding path program 1 times [2024-10-12 00:13:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108277828] [2024-10-12 00:13:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:13:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:59,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108277828] [2024-10-12 00:13:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108277828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:13:59,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:13:59,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:13:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789782269] [2024-10-12 00:13:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:13:59,585 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:59,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:59,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:59,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:59,585 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:13:59,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:59,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:59,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:59,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2024-10-12 00:13:59,586 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:59,586 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:59,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:59,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:59,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:59,655 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:59,656 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:13:59,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:59,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:59,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:13:59,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:59,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:59,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:13:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:59,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:59,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:13:59,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:13:59,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:59,787 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:13:59,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:13:59,797 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:59,797 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:59,797 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:59,797 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:59,797 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:13:59,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:59,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:59,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:59,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2024-10-12 00:13:59,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:59,798 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:59,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:59,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:59,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:59,846 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:59,849 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:13:59,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:59,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:59,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:59,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:13:59,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:59,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:59,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:59,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:59,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:59,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:59,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:59,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:59,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:13:59,880 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:13:59,881 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-12 00:13:59,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:59,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:59,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:13:59,887 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:13:59,887 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:13:59,887 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:13:59,888 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-12 00:13:59,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:59,903 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:13:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:13:59,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,953 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:13:59,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:00,012 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-12 00:14:00,013 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-12 00:14:00,070 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-12 00:14:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:00,072 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-12 00:14:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:14:00,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:14:00,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:00,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-12 00:14:00,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:00,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 8 letters. [2024-10-12 00:14:00,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:00,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-10-12 00:14:00,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:14:00,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 38 transitions. [2024-10-12 00:14:00,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:14:00,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:14:00,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2024-10-12 00:14:00,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:00,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-12 00:14:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2024-10-12 00:14:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-12 00:14:00,080 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-12 00:14:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-12 00:14:00,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-12 00:14:00,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:00,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:00,086 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-12 00:14:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:00,122 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-12 00:14:00,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2024-10-12 00:14:00,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:14:00,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2024-10-12 00:14:00,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 00:14:00,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:14:00,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2024-10-12 00:14:00,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:00,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 00:14:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2024-10-12 00:14:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-12 00:14:00,127 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-12 00:14:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-12 00:14:00,128 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-12 00:14:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:00,129 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-12 00:14:00,129 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:14:00,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-10-12 00:14:00,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:14:00,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:00,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:00,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:14:00,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:00,132 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-12 00:14:00,132 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-12 00:14:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 3 times [2024-10-12 00:14:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571906163] [2024-10-12 00:14:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash -601564238, now seen corresponding path program 1 times [2024-10-12 00:14:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257875404] [2024-10-12 00:14:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:00,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash 273756331, now seen corresponding path program 1 times [2024-10-12 00:14:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119338430] [2024-10-12 00:14:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:00,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:14:00,319 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:00,319 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:00,319 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:00,319 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:00,319 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:00,319 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,319 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:00,319 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:00,319 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2024-10-12 00:14:00,319 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:00,319 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:00,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,382 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:00,382 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:00,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:00,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:00,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:14:00,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:00,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:00,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:14:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:00,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:00,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:14:00,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:00,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:00,440 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:00,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:14:00,444 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:00,444 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:00,444 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:00,444 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:00,444 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:00,445 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,445 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:00,445 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:00,445 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2024-10-12 00:14:00,445 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:00,445 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:00,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:00,494 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:00,494 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:00,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:00,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:00,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:14:00,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:00,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:00,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:00,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:00,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:00,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:00,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:00,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:00,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:00,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:14:00,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:00,523 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:00,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:14:00,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:00,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:00,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:00,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:00,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:00,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:00,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:00,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:00,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:00,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:14:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:00,551 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:00,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:14:00,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:00,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:00,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:00,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:00,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:00,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:00,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:00,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:00,568 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:00,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:00,570 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:00,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:00,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:00,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:14:00,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:00,575 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:00,575 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:00,575 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-12 00:14:00,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:14:00,586 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:00,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:00,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:00,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:00,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:00,713 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-12 00:14:00,713 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-12 00:14:00,905 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-12 00:14:00,905 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-12 00:14:00,906 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-12 00:14:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2024-10-12 00:14:00,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 11 letters. [2024-10-12 00:14:00,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:00,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 15 letters. Loop has 11 letters. [2024-10-12 00:14:00,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:00,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 22 letters. [2024-10-12 00:14:00,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:00,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 248 transitions. [2024-10-12 00:14:00,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-12 00:14:00,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 157 states and 246 transitions. [2024-10-12 00:14:00,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-10-12 00:14:00,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-10-12 00:14:00,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 246 transitions. [2024-10-12 00:14:00,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:00,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-10-12 00:14:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 246 transitions. [2024-10-12 00:14:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2024-10-12 00:14:00,942 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-12 00:14:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2024-10-12 00:14:00,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 197 transitions. [2024-10-12 00:14:00,946 INFO L425 stractBuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2024-10-12 00:14:00,946 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:14:00,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 197 transitions. [2024-10-12 00:14:00,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-12 00:14:00,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:00,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:00,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:14:00,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:00,951 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-12 00:14:00,951 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-12 00:14:00,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 1 times [2024-10-12 00:14:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382139437] [2024-10-12 00:14:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:00,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1796298250, now seen corresponding path program 1 times [2024-10-12 00:14:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414356945] [2024-10-12 00:14:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:01,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:01,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414356945] [2024-10-12 00:14:01,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414356945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:01,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:01,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 00:14:01,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541818644] [2024-10-12 00:14:01,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:01,164 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:01,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:14:01,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:14:01,166 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-12 00:14:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:01,381 INFO L93 Difference]: Finished difference Result 265 states and 484 transitions. [2024-10-12 00:14:01,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 484 transitions. [2024-10-12 00:14:01,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2024-10-12 00:14:01,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 256 states and 475 transitions. [2024-10-12 00:14:01,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-10-12 00:14:01,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-12 00:14:01,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 475 transitions. [2024-10-12 00:14:01,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:01,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 256 states and 475 transitions. [2024-10-12 00:14:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 475 transitions. [2024-10-12 00:14:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2024-10-12 00:14:01,423 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-12 00:14:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 383 transitions. [2024-10-12 00:14:01,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 210 states and 383 transitions. [2024-10-12 00:14:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:14:01,426 INFO L425 stractBuchiCegarLoop]: Abstraction has 210 states and 383 transitions. [2024-10-12 00:14:01,426 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:14:01,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 383 transitions. [2024-10-12 00:14:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2024-10-12 00:14:01,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:01,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:01,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:14:01,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:01,428 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-12 00:14:01,428 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-12 00:14:01,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 2 times [2024-10-12 00:14:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27930084] [2024-10-12 00:14:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:01,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:01,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:01,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 499890354, now seen corresponding path program 1 times [2024-10-12 00:14:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005296620] [2024-10-12 00:14:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:01,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:01,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash 188539696, now seen corresponding path program 1 times [2024-10-12 00:14:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212394514] [2024-10-12 00:14:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212394514] [2024-10-12 00:14:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212394514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:01,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:14:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873888240] [2024-10-12 00:14:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:01,585 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:01,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:01,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:01,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:01,585 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:01,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:01,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:01,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2024-10-12 00:14:01,586 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:01,586 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:01,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:01,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:01,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:01,615 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:01,615 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:14:01,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:01,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:01,633 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:01,633 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-12 00:14:01,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:14:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:14:01,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:01,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:01,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:14:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,669 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:14:01,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:01,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:01,702 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:01,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:01,706 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:01,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:01,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:01,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:01,706 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:01,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:01,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:01,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2024-10-12 00:14:01,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:01,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:01,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:01,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:01,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:01,745 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:01,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:01,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,747 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:14:01,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:01,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:01,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:01,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:01,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:01,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:01,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:01,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:01,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:01,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:14:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,772 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:14:01,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:01,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:01,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:01,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:01,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:01,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:01,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:01,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:01,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:01,788 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:01,788 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,789 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:14:01,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:01,791 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:01,791 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:01,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-12 00:14:01,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:01,802 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:01,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:01,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:01,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:01,888 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-12 00:14:01,889 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-12 00:14:02,027 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-12 00:14:02,028 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-12 00:14:02,029 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-12 00:14:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2024-10-12 00:14:02,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-12 00:14:02,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:02,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 13 letters. Loop has 8 letters. [2024-10-12 00:14:02,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:02,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 5 letters. Loop has 16 letters. [2024-10-12 00:14:02,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:02,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 2382 transitions. [2024-10-12 00:14:02,043 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 62 [2024-10-12 00:14:02,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 1022 states and 2053 transitions. [2024-10-12 00:14:02,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-10-12 00:14:02,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2024-10-12 00:14:02,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1022 states and 2053 transitions. [2024-10-12 00:14:02,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:02,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1022 states and 2053 transitions. [2024-10-12 00:14:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states and 2053 transitions. [2024-10-12 00:14:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 843. [2024-10-12 00:14:02,111 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-12 00:14:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1647 transitions. [2024-10-12 00:14:02,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 843 states and 1647 transitions. [2024-10-12 00:14:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:14:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:14:02,117 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-12 00:14:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:02,170 INFO L93 Difference]: Finished difference Result 754 states and 1224 transitions. [2024-10-12 00:14:02,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1224 transitions. [2024-10-12 00:14:02,177 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-12 00:14:02,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 337 states and 528 transitions. [2024-10-12 00:14:02,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-10-12 00:14:02,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-10-12 00:14:02,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 528 transitions. [2024-10-12 00:14:02,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:02,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 528 transitions. [2024-10-12 00:14:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 528 transitions. [2024-10-12 00:14:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 315. [2024-10-12 00:14:02,189 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-12 00:14:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 500 transitions. [2024-10-12 00:14:02,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 500 transitions. [2024-10-12 00:14:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:14:02,192 INFO L425 stractBuchiCegarLoop]: Abstraction has 315 states and 500 transitions. [2024-10-12 00:14:02,192 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:14:02,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 500 transitions. [2024-10-12 00:14:02,194 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-12 00:14:02,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:02,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:02,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:02,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:02,195 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); 4024#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4296#$Ultimate##0 ~p := #in~p;~q := #in~q; 4256#L20 assume ~p <= 0;#res := 1; 4257#partsFINAL assume true; 4221#partsEXIT >#71#return; 4074#L36-1 [2024-10-12 00:14:02,195 INFO L747 eck$LassoCheckResult]: Loop: 4074#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4075#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; 4259#L20 assume ~p <= 0;#res := 1; 4254#partsFINAL assume true; 4255#partsEXIT >#71#return; 4074#L36-1 [2024-10-12 00:14:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 621423982, now seen corresponding path program 1 times [2024-10-12 00:14:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615022323] [2024-10-12 00:14:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:14:02,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:02,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 283574208, now seen corresponding path program 1 times [2024-10-12 00:14:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747201678] [2024-10-12 00:14:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:02,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash -597668429, now seen corresponding path program 1 times [2024-10-12 00:14:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445817690] [2024-10-12 00:14:02,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:02,305 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:02,305 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:02,305 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:02,305 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:02,305 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:02,305 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,305 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:02,305 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:02,305 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2024-10-12 00:14:02,305 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:02,306 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:02,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:02,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:02,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:02,338 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:02,339 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,341 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:14:02,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:02,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:02,355 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:02,355 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-12 00:14:02,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,370 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:14:02,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:02,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:02,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:14:02,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,398 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:14:02,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:02,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:02,601 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:02,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:14:02,606 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:02,606 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:02,606 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:02,606 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:02,606 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:02,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:02,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:02,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2024-10-12 00:14:02,606 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:02,606 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:02,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:02,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:02,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:02,642 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:02,642 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:02,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,643 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:14:02,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:02,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:02,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:02,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:02,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:02,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:02,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:02,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:02,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:02,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:02,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,668 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:02,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:14:02,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:02,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:02,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:02,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:02,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:02,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:02,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:02,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:02,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:02,690 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:02,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:02,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,692 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:14:02,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:02,693 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:02,693 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:02,694 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-12 00:14:02,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:02,705 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:02,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:02,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:02,840 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-12 00:14:02,840 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-12 00:14:02,921 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-12 00:14:02,921 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-12 00:14:02,922 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-12 00:14:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2024-10-12 00:14:02,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2024-10-12 00:14:02,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:02,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2024-10-12 00:14:02,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:02,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2024-10-12 00:14:02,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:02,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 789 transitions. [2024-10-12 00:14:02,931 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2024-10-12 00:14:02,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 390 states and 617 transitions. [2024-10-12 00:14:02,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 262 [2024-10-12 00:14:02,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2024-10-12 00:14:02,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 390 states and 617 transitions. [2024-10-12 00:14:02,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:02,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 390 states and 617 transitions. [2024-10-12 00:14:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states and 617 transitions. [2024-10-12 00:14:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2024-10-12 00:14:02,941 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-12 00:14:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 615 transitions. [2024-10-12 00:14:02,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 388 states and 615 transitions. [2024-10-12 00:14:02,943 INFO L425 stractBuchiCegarLoop]: Abstraction has 388 states and 615 transitions. [2024-10-12 00:14:02,943 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:14:02,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 388 states and 615 transitions. [2024-10-12 00:14:02,945 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2024-10-12 00:14:02,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:02,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:02,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:02,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:14:02,946 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-12 00:14:02,946 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-12 00:14:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2084292643, now seen corresponding path program 1 times [2024-10-12 00:14:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149500281] [2024-10-12 00:14:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149500281] [2024-10-12 00:14:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149500281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:14:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534920135] [2024-10-12 00:14:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:02,976 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:02,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash 28756408, now seen corresponding path program 1 times [2024-10-12 00:14:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402818088] [2024-10-12 00:14:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:03,021 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:03,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:03,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:03,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:03,021 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:03,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:03,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:03,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2024-10-12 00:14:03,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:03,021 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:03,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:03,064 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:03,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,065 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:14:03,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:03,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:03,079 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:03,079 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:03,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:14:03,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,091 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:14:03,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:03,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:03,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,122 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:14:03,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:03,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:03,240 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:03,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-12 00:14:03,245 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:03,245 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:03,245 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:03,245 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:03,245 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:03,245 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,245 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:03,245 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:03,245 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2024-10-12 00:14:03,245 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:03,245 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:03,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:03,282 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:03,282 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:03,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,284 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:14:03,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:03,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:03,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:03,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:03,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:03,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:03,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:03,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:03,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:03,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,308 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:14:03,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:03,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:03,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:03,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:03,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:03,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:03,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:03,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:03,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:03,325 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:03,325 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:03,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,326 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:14:03,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:03,327 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:03,327 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:03,327 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-10-12 00:14:03,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:03,338 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:03,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:03,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:03,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:03,418 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-12 00:14:03,418 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-12 00:14:03,502 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-12 00:14:03,502 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-12 00:14:03,503 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-12 00:14:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2024-10-12 00:14:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2024-10-12 00:14:03,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2024-10-12 00:14:03,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:03,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2024-10-12 00:14:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:03,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1110 states and 2143 transitions. [2024-10-12 00:14:03,517 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 232 [2024-10-12 00:14:03,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1110 states to 1049 states and 2041 transitions. [2024-10-12 00:14:03,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2024-10-12 00:14:03,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 595 [2024-10-12 00:14:03,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1049 states and 2041 transitions. [2024-10-12 00:14:03,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:03,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1049 states and 2041 transitions. [2024-10-12 00:14:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states and 2041 transitions. [2024-10-12 00:14:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 952. [2024-10-12 00:14:03,580 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-12 00:14:03,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:14:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1761 transitions. [2024-10-12 00:14:03,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 952 states and 1761 transitions. [2024-10-12 00:14:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:14:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:14:03,587 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-12 00:14:03,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:03,625 INFO L93 Difference]: Finished difference Result 825 states and 1466 transitions. [2024-10-12 00:14:03,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1466 transitions. [2024-10-12 00:14:03,632 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 149 [2024-10-12 00:14:03,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 824 states and 1465 transitions. [2024-10-12 00:14:03,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2024-10-12 00:14:03,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2024-10-12 00:14:03,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 824 states and 1465 transitions. [2024-10-12 00:14:03,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:03,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 824 states and 1465 transitions. [2024-10-12 00:14:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states and 1465 transitions. [2024-10-12 00:14:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 816. [2024-10-12 00:14:03,659 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-12 00:14:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1457 transitions. [2024-10-12 00:14:03,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 816 states and 1457 transitions. [2024-10-12 00:14:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:14:03,663 INFO L425 stractBuchiCegarLoop]: Abstraction has 816 states and 1457 transitions. [2024-10-12 00:14:03,663 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:14:03,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 816 states and 1457 transitions. [2024-10-12 00:14:03,667 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 147 [2024-10-12 00:14:03,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:03,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:03,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:03,668 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-12 00:14:03,668 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-12 00:14:03,669 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-12 00:14:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash -103488292, now seen corresponding path program 2 times [2024-10-12 00:14:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84578349] [2024-10-12 00:14:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,710 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-12 00:14:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:03,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84578349] [2024-10-12 00:14:03,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84578349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:03,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758759492] [2024-10-12 00:14:03,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:03,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:03,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,712 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-12 00:14:03,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:03,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:03,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:03,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:03,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:03,828 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-12 00:14:03,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758759492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:03,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:03,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 00:14:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240322704] [2024-10-12 00:14:03,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:03,829 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:03,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash 112905049, now seen corresponding path program 1 times [2024-10-12 00:14:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204054690] [2024-10-12 00:14:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:03,969 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-12 00:14:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204054690] [2024-10-12 00:14:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204054690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:03,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524092361] [2024-10-12 00:14:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:03,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:03,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:03,973 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:03,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-12 00:14:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:14:04,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:04,113 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-12 00:14:04,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:04,222 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-12 00:14:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524092361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:04,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-12 00:14:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484932435] [2024-10-12 00:14:04,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:04,234 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:14:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:14:04,235 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-12 00:14:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:04,277 INFO L93 Difference]: Finished difference Result 868 states and 1539 transitions. [2024-10-12 00:14:04,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 868 states and 1539 transitions. [2024-10-12 00:14:04,283 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 157 [2024-10-12 00:14:04,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 868 states to 861 states and 1531 transitions. [2024-10-12 00:14:04,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2024-10-12 00:14:04,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2024-10-12 00:14:04,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1531 transitions. [2024-10-12 00:14:04,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:04,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 861 states and 1531 transitions. [2024-10-12 00:14:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1531 transitions. [2024-10-12 00:14:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 815. [2024-10-12 00:14:04,308 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-12 00:14:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1455 transitions. [2024-10-12 00:14:04,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 815 states and 1455 transitions. [2024-10-12 00:14:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:14:04,312 INFO L425 stractBuchiCegarLoop]: Abstraction has 815 states and 1455 transitions. [2024-10-12 00:14:04,312 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:14:04,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 815 states and 1455 transitions. [2024-10-12 00:14:04,316 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 147 [2024-10-12 00:14:04,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:04,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:04,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:04,317 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-12 00:14:04,318 INFO L745 eck$LassoCheckResult]: Stem: 10415#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10371#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; 10372#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; 10369#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; 10370#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10453#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10973#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10974#$Ultimate##0 ~p := #in~p;~q := #in~q; 10978#L20 assume ~p <= 0;#res := 1; 10976#partsFINAL assume true; 10972#partsEXIT >#71#return; 10954#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10953#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10945#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10947#$Ultimate##0 ~p := #in~p;~q := #in~q; 10949#L20 assume ~p <= 0;#res := 1; 10948#partsFINAL assume true; 10944#partsEXIT >#71#return; 10941#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10720#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 10719#L35-3 havoc main_~q~0#1; 10718#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10710#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10694#L35-2 [2024-10-12 00:14:04,318 INFO L747 eck$LassoCheckResult]: Loop: 10694#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10686#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10688#$Ultimate##0 ~p := #in~p;~q := #in~q; 10700#L20 assume !(~p <= 0); 10701#L21 assume ~q <= 0;#res := 0; 10957#partsFINAL assume true; 10956#partsEXIT >#71#return; 10676#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10675#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10458#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10464#$Ultimate##0 ~p := #in~p;~q := #in~q; 10618#L20 assume !(~p <= 0); 10614#L21 assume !(~q <= 0); 10535#L22 assume !(~q > ~p); 10500#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10598#$Ultimate##0 ~p := #in~p;~q := #in~q; 10632#L20 assume ~p <= 0;#res := 1; 10631#partsFINAL assume true; 10627#partsEXIT >#67#return; 10483#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10599#$Ultimate##0 ~p := #in~p;~q := #in~q; 10608#L20 assume !(~p <= 0); 10606#L21 assume ~q <= 0;#res := 0; 10595#partsFINAL assume true; 10596#partsEXIT >#69#return; 10519#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 10465#partsFINAL assume true; 10466#partsEXIT >#71#return; 10661#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10456#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 10457#L35-3 havoc main_~q~0#1; 10712#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10711#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10694#L35-2 [2024-10-12 00:14:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167415, now seen corresponding path program 3 times [2024-10-12 00:14:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847216882] [2024-10-12 00:14:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:04,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:04,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 112905049, now seen corresponding path program 2 times [2024-10-12 00:14:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055566305] [2024-10-12 00:14:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,425 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-12 00:14:04,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:04,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055566305] [2024-10-12 00:14:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055566305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408613531] [2024-10-12 00:14:04,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:04,427 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:04,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-12 00:14:04,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:04,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:04,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:14:04,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:04,568 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-12 00:14:04,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:04,681 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-12 00:14:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408613531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:04,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-12 00:14:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508895667] [2024-10-12 00:14:04,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:04,682 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:04,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 00:14:04,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-12 00:14:04,683 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-12 00:14:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:04,976 INFO L93 Difference]: Finished difference Result 1101 states and 2036 transitions. [2024-10-12 00:14:04,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1101 states and 2036 transitions. [2024-10-12 00:14:04,984 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 182 [2024-10-12 00:14:05,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1101 states to 1026 states and 1936 transitions. [2024-10-12 00:14:05,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2024-10-12 00:14:05,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2024-10-12 00:14:05,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1936 transitions. [2024-10-12 00:14:05,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:05,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1936 transitions. [2024-10-12 00:14:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1936 transitions. [2024-10-12 00:14:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 831. [2024-10-12 00:14:05,032 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-12 00:14:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1476 transitions. [2024-10-12 00:14:05,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1476 transitions. [2024-10-12 00:14:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 00:14:05,036 INFO L425 stractBuchiCegarLoop]: Abstraction has 831 states and 1476 transitions. [2024-10-12 00:14:05,036 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:14:05,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1476 transitions. [2024-10-12 00:14:05,040 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 116 [2024-10-12 00:14:05,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:05,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:05,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:05,041 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-12 00:14:05,041 INFO L745 eck$LassoCheckResult]: Stem: 12594#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 12539#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; 12540#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; 12830#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12831#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 12850#$Ultimate##0 ~p := #in~p;~q := #in~q; 12854#L20 assume ~p <= 0;#res := 1; 12855#partsFINAL assume true; 12849#partsEXIT >#71#return; 12839#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12840#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12609#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13243#$Ultimate##0 ~p := #in~p;~q := #in~q; 12608#L20 assume ~p <= 0;#res := 1; 12610#partsFINAL assume true; 13319#partsEXIT >#71#return; 13318#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12619#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 12620#L35-3 havoc main_~q~0#1; 13094#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13093#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 12612#L35-2 [2024-10-12 00:14:05,041 INFO L747 eck$LassoCheckResult]: Loop: 12612#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12535#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 12536#$Ultimate##0 ~p := #in~p;~q := #in~q; 13308#L20 assume !(~p <= 0); 12574#L21 assume ~q <= 0;#res := 0; 12575#partsFINAL assume true; 13334#partsEXIT >#71#return; 13302#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13111#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12868#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13040#$Ultimate##0 ~p := #in~p;~q := #in~q; 13038#L20 assume !(~p <= 0); 13036#L21 assume !(~q <= 0); 13035#L22 assume !(~q > ~p); 12904#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12948#$Ultimate##0 ~p := #in~p;~q := #in~q; 12968#L20 assume ~p <= 0;#res := 1; 12963#partsFINAL assume true; 12964#partsEXIT >#67#return; 12885#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12934#$Ultimate##0 ~p := #in~p;~q := #in~q; 13024#L20 assume !(~p <= 0); 12998#L21 assume ~q <= 0;#res := 0; 13021#partsFINAL assume true; 13084#partsEXIT >#69#return; 12925#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13107#partsFINAL assume true; 13105#partsEXIT >#71#return; 13106#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13110#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12616#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13040#$Ultimate##0 ~p := #in~p;~q := #in~q; 13038#L20 assume !(~p <= 0); 13036#L21 assume !(~q <= 0); 13035#L22 assume !(~q > ~p); 12904#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12948#$Ultimate##0 ~p := #in~p;~q := #in~q; 12968#L20 assume ~p <= 0;#res := 1; 12963#partsFINAL assume true; 12964#partsEXIT >#67#return; 12885#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12934#$Ultimate##0 ~p := #in~p;~q := #in~q; 13024#L20 assume !(~p <= 0); 12998#L21 assume ~q <= 0;#res := 0; 13021#partsFINAL assume true; 13084#partsEXIT >#69#return; 12925#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13107#partsFINAL assume true; 13105#partsEXIT >#71#return; 13100#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12615#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 12555#L35-3 havoc main_~q~0#1; 12556#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12611#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 12612#L35-2 [2024-10-12 00:14:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167415, now seen corresponding path program 4 times [2024-10-12 00:14:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77297982] [2024-10-12 00:14:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:05,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:05,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash 541134186, now seen corresponding path program 3 times [2024-10-12 00:14:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913803480] [2024-10-12 00:14:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 00:14:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:05,169 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-12 00:14:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913803480] [2024-10-12 00:14:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913803480] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198574351] [2024-10-12 00:14:05,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:05,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:05,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:05,171 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:05,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-12 00:14:05,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 00:14:05,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:05,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:05,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:05,333 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-12 00:14:05,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:05,639 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-12 00:14:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198574351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:05,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2024-10-12 00:14:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293931890] [2024-10-12 00:14:05,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:05,640 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 00:14:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-10-12 00:14:05,641 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-12 00:14:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:06,204 INFO L93 Difference]: Finished difference Result 1217 states and 2217 transitions. [2024-10-12 00:14:06,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1217 states and 2217 transitions. [2024-10-12 00:14:06,213 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 168 [2024-10-12 00:14:06,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1217 states to 1176 states and 2144 transitions. [2024-10-12 00:14:06,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2024-10-12 00:14:06,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-10-12 00:14:06,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1176 states and 2144 transitions. [2024-10-12 00:14:06,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:06,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1176 states and 2144 transitions. [2024-10-12 00:14:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states and 2144 transitions. [2024-10-12 00:14:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1013. [2024-10-12 00:14:06,247 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-12 00:14:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1864 transitions. [2024-10-12 00:14:06,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1013 states and 1864 transitions. [2024-10-12 00:14:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-12 00:14:06,251 INFO L425 stractBuchiCegarLoop]: Abstraction has 1013 states and 1864 transitions. [2024-10-12 00:14:06,251 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:14:06,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1013 states and 1864 transitions. [2024-10-12 00:14:06,256 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 130 [2024-10-12 00:14:06,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:06,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:06,256 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-12 00:14:06,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:14:06,256 INFO L745 eck$LassoCheckResult]: Stem: 15081#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 15039#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; 15040#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; 15733#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 15816#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 15817#$Ultimate##0 ~p := #in~p;~q := #in~q; 15824#L20 assume ~p <= 0;#res := 1; 15821#partsFINAL assume true; 15815#partsEXIT >#71#return; 15813#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 15810#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 15036#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 15037#$Ultimate##0 ~p := #in~p;~q := #in~q; 15763#L20 assume !(~p <= 0); 15761#L21 assume !(~q <= 0); 15759#L22 assume ~q > ~p; 15042#L22-1 call #t~ret0 := parts(~p, ~p);< 15646#$Ultimate##0 ~p := #in~p;~q := #in~q; 15765#L20 assume !(~p <= 0); 15900#L21 assume !(~q <= 0); 15055#L22 assume !(~q > ~p); 15041#L23 call #t~ret1 := parts(~p - ~q, ~q);< 15043#$Ultimate##0 [2024-10-12 00:14:06,256 INFO L747 eck$LassoCheckResult]: Loop: 15043#$Ultimate##0 ~p := #in~p;~q := #in~q; 15825#L20 assume !(~p <= 0); 15826#L21 assume !(~q <= 0); 15841#L22 assume !(~q > ~p); 15786#L23 call #t~ret1 := parts(~p - ~q, ~q);< 15043#$Ultimate##0 [2024-10-12 00:14:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -571940934, now seen corresponding path program 1 times [2024-10-12 00:14:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434010010] [2024-10-12 00:14:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,284 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-12 00:14:06,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434010010] [2024-10-12 00:14:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434010010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:06,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:14:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174934476] [2024-10-12 00:14:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:06,284 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 28756503, now seen corresponding path program 1 times [2024-10-12 00:14:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016105667] [2024-10-12 00:14:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:06,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:06,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:06,331 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:06,331 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:06,331 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:06,331 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:06,331 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:06,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:06,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:06,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2024-10-12 00:14:06,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:06,332 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:06,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,375 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:06,376 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,378 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:14:06,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:06,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,394 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:06,394 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-12 00:14:06,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,407 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:14:06,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:06,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,420 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:06,421 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-12 00:14:06,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:14:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,434 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:14:06,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:06,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,448 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:06,448 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:06,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,460 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:14:06,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:06,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,474 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:06,474 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:06,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,488 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:14:06,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:06,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,502 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:06,502 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-12 00:14:06,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,514 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:14:06,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:06,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,543 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:14:06,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:06,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:06,607 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:06,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,611 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:06,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:06,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:06,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:06,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:06,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:06,611 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:06,611 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2024-10-12 00:14:06,611 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:06,611 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:06,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:06,653 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:06,653 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,655 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:14:06,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:06,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:06,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:06,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:06,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:06,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:06,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:06,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:06,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:06,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,681 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:14:06,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:06,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:06,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:06,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:06,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:06,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:06,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:06,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:06,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:06,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-12 00:14:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,708 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:14:06,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:06,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:06,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:06,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:06,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:06,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:06,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:06,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:06,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:06,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,732 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:14:06,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:06,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:06,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:06,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:06,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:06,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:06,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:06,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:06,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:06,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,758 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:14:06,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:06,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:06,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:06,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:06,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:06,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:06,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:06,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:06,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:06,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:06,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,784 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:14:06,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:06,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:06,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:06,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:06,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:06,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:06,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:06,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:06,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:06,800 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:06,800 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:06,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,801 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:14:06,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:06,803 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:06,803 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:06,803 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2024-10-12 00:14:06,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:14:06,813 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:06,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:06,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:06,928 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-12 00:14:06,928 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-12 00:14:07,025 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-12 00:14:07,026 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-12 00:14:07,026 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-12 00:14:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2024-10-12 00:14:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 24 letters. Loop has 5 letters. [2024-10-12 00:14:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 29 letters. Loop has 5 letters. [2024-10-12 00:14:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 24 letters. Loop has 10 letters. [2024-10-12 00:14:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:07,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1516 states and 2804 transitions. [2024-10-12 00:14:07,037 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 136 [2024-10-12 00:14:07,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-12 00:14:07,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1516 states to 1358 states and 2570 transitions. [2024-10-12 00:14:07,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2024-10-12 00:14:07,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-10-12 00:14:07,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1358 states and 2570 transitions. [2024-10-12 00:14:07,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:07,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1358 states and 2570 transitions. [2024-10-12 00:14:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states and 2570 transitions. [2024-10-12 00:14:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1314. [2024-10-12 00:14:07,073 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-12 00:14:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2461 transitions. [2024-10-12 00:14:07,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1314 states and 2461 transitions. [2024-10-12 00:14:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:14:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:14:07,078 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-12 00:14:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:07,104 INFO L93 Difference]: Finished difference Result 1062 states and 1988 transitions. [2024-10-12 00:14:07,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1062 states and 1988 transitions. [2024-10-12 00:14:07,110 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 88 [2024-10-12 00:14:07,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1062 states to 1046 states and 1971 transitions. [2024-10-12 00:14:07,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2024-10-12 00:14:07,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2024-10-12 00:14:07,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1046 states and 1971 transitions. [2024-10-12 00:14:07,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:07,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1046 states and 1971 transitions. [2024-10-12 00:14:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states and 1971 transitions. [2024-10-12 00:14:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2024-10-12 00:14:07,138 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-12 00:14:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1969 transitions. [2024-10-12 00:14:07,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1044 states and 1969 transitions. [2024-10-12 00:14:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:14:07,142 INFO L425 stractBuchiCegarLoop]: Abstraction has 1044 states and 1969 transitions. [2024-10-12 00:14:07,142 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:14:07,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1044 states and 1969 transitions. [2024-10-12 00:14:07,146 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 88 [2024-10-12 00:14:07,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:07,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:07,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:07,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:07,147 INFO L745 eck$LassoCheckResult]: Stem: 20124#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20089#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; 20090#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; 20087#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; 20088#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20508#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20496#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20497#$Ultimate##0 ~p := #in~p;~q := #in~q; 20511#L20 assume ~p <= 0;#res := 1; 20507#partsFINAL assume true; 20495#partsEXIT >#71#return; 20492#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20487#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20472#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20474#$Ultimate##0 ~p := #in~p;~q := #in~q; 20519#L20 assume ~p <= 0;#res := 1; 20518#partsFINAL assume true; 20471#partsEXIT >#71#return; 20473#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20467#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 20466#L35-3 havoc main_~q~0#1; 20357#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20352#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20349#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20345#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20347#$Ultimate##0 ~p := #in~p;~q := #in~q; 20365#L20 assume ~p <= 0;#res := 1; 20366#partsFINAL assume true; 20344#partsEXIT >#71#return; 20341#L36-1 [2024-10-12 00:14:07,147 INFO L747 eck$LassoCheckResult]: Loop: 20341#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20340#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20074#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20339#$Ultimate##0 ~p := #in~p;~q := #in~q; 20338#L20 assume ~p <= 0;#res := 1; 20337#partsFINAL assume true; 20342#partsEXIT >#71#return; 20341#L36-1 [2024-10-12 00:14:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:07,148 INFO L85 PathProgramCache]: Analyzing trace with hash -537230682, now seen corresponding path program 5 times [2024-10-12 00:14:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935847938] [2024-10-12 00:14:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,180 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-12 00:14:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935847938] [2024-10-12 00:14:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935847938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:14:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8316889] [2024-10-12 00:14:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:07,181 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:07,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 283574208, now seen corresponding path program 2 times [2024-10-12 00:14:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180970818] [2024-10-12 00:14:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:07,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:07,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:07,225 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:07,225 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:07,225 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:07,225 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:07,225 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:07,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:07,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:07,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2024-10-12 00:14:07,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:07,225 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:07,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,245 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:07,246 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:07,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,247 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:14:07,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-12 00:14:07,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,273 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:14:07,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:07,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,471 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:07,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:14:07,476 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:07,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:07,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:07,476 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:07,476 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:07,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:07,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:07,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2024-10-12 00:14:07,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:07,476 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:07,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,500 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:07,500 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:07,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,501 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:14:07,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,515 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:07,516 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:07,516 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,518 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:14:07,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:07,518 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:07,518 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:07,519 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-12 00:14:07,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:07,529 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:07,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:07,672 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-12 00:14:07,672 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-12 00:14:07,715 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-12 00:14:07,715 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-12 00:14:07,717 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-12 00:14:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-10-12 00:14:07,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 29 letters. Loop has 7 letters. [2024-10-12 00:14:07,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:07,717 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:07,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:07,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:14:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:07,873 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-12 00:14:07,873 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-12 00:14:07,912 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-12 00:14:07,912 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-12 00:14:07,912 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-12 00:14:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2024-10-12 00:14:07,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 29 letters. Loop has 7 letters. [2024-10-12 00:14:07,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:07,913 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:08,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:08,071 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-12 00:14:08,071 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-12 00:14:08,149 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-12 00:14:08,150 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-12 00:14:08,150 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-12 00:14:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2024-10-12 00:14:08,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 29 letters. Loop has 7 letters. [2024-10-12 00:14:08,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 36 letters. Loop has 7 letters. [2024-10-12 00:14:08,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 29 letters. Loop has 14 letters. [2024-10-12 00:14:08,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1991 states and 3830 transitions. [2024-10-12 00:14:08,167 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-10-12 00:14:08,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1991 states to 1609 states and 2925 transitions. [2024-10-12 00:14:08,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2024-10-12 00:14:08,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-10-12 00:14:08,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1609 states and 2925 transitions. [2024-10-12 00:14:08,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:08,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1609 states and 2925 transitions. [2024-10-12 00:14:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 2925 transitions. [2024-10-12 00:14:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1533. [2024-10-12 00:14:08,211 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-12 00:14:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2804 transitions. [2024-10-12 00:14:08,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1533 states and 2804 transitions. [2024-10-12 00:14:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:14:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:14:08,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-12 00:14:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:08,265 INFO L93 Difference]: Finished difference Result 879 states and 1532 transitions. [2024-10-12 00:14:08,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 879 states and 1532 transitions. [2024-10-12 00:14:08,272 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-10-12 00:14:08,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 879 states to 496 states and 873 transitions. [2024-10-12 00:14:08,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2024-10-12 00:14:08,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2024-10-12 00:14:08,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 873 transitions. [2024-10-12 00:14:08,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:08,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 496 states and 873 transitions. [2024-10-12 00:14:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 873 transitions. [2024-10-12 00:14:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 478. [2024-10-12 00:14:08,285 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-12 00:14:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 847 transitions. [2024-10-12 00:14:08,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 478 states and 847 transitions. [2024-10-12 00:14:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:14:08,288 INFO L425 stractBuchiCegarLoop]: Abstraction has 478 states and 847 transitions. [2024-10-12 00:14:08,288 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:14:08,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 847 transitions. [2024-10-12 00:14:08,289 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-10-12 00:14:08,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:08,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:08,291 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-12 00:14:08,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:08,291 INFO L745 eck$LassoCheckResult]: Stem: 28121#$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; 28144#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28174#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28175#$Ultimate##0 ~p := #in~p;~q := #in~q; 28179#L20 assume ~p <= 0;#res := 1; 28177#partsFINAL assume true; 28173#partsEXIT >#71#return; 28171#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28170#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; 28181#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28252#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 28251#L35-3 havoc main_~q~0#1; 28070#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28071#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28224#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; 28284#L20 assume !(~p <= 0); 28283#L21 assume ~q <= 0;#res := 0; 28235#partsFINAL assume true; 28158#partsEXIT >#71#return; 28139#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28134#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; 28213#L20 assume !(~p <= 0); 28211#L21 assume !(~q <= 0); 28209#L22 assume !(~q > ~p); 28101#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28406#$Ultimate##0 ~p := #in~p;~q := #in~q; 28407#L20 assume ~p <= 0;#res := 1; 28441#partsFINAL assume true; 28438#partsEXIT >#67#return; 28034#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 28437#$Ultimate##0 [2024-10-12 00:14:08,291 INFO L747 eck$LassoCheckResult]: Loop: 28437#$Ultimate##0 ~p := #in~p;~q := #in~q; 28426#L20 assume !(~p <= 0); 28427#L21 assume !(~q <= 0); 28418#L22 assume !(~q > ~p); 28044#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28431#$Ultimate##0 ~p := #in~p;~q := #in~q; 28432#L20 assume ~p <= 0;#res := 1; 28444#partsFINAL assume true; 28439#partsEXIT >#67#return; 28036#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 28437#$Ultimate##0 [2024-10-12 00:14:08,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1463979575, now seen corresponding path program 1 times [2024-10-12 00:14:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260688237] [2024-10-12 00:14:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:08,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:08,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2050528601, now seen corresponding path program 1 times [2024-10-12 00:14:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117789065] [2024-10-12 00:14:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:08,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:08,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1784633359, now seen corresponding path program 2 times [2024-10-12 00:14:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833201196] [2024-10-12 00:14:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 00:14:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,378 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-12 00:14:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833201196] [2024-10-12 00:14:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833201196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042710523] [2024-10-12 00:14:08,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:08,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:08,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,380 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-10-12 00:14:08,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:08,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:08,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:08,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:08,446 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-12 00:14:08,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:08,483 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-12 00:14:08,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042710523] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:08,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:08,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2024-10-12 00:14:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965559152] [2024-10-12 00:14:08,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:08,572 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:08,572 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:08,572 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:08,572 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:08,572 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:08,572 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,572 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:08,572 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:08,572 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2024-10-12 00:14:08,572 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:08,573 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:08,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,614 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:08,615 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:08,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,616 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:14:08,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,628 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,628 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-12 00:14:08,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,640 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:14:08,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,652 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,652 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:08,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-12 00:14:08,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,663 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:14:08,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,675 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,675 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:08,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:14:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,686 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:14:08,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,698 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,698 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-12 00:14:08,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:08,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,709 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:14:08,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,721 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,721 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-12 00:14:08,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 00:14:08,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,733 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:14:08,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-12 00:14:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,757 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:14:08,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:08,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,900 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:08,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:14:08,906 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:08,906 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:08,906 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:08,906 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:08,906 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:08,906 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:08,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:08,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2024-10-12 00:14:08,906 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:08,906 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:08,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,951 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:08,951 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:08,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,954 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:14:08,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:08,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:08,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:08,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:08,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:08,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:08,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:08,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:08,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:08,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:14:08,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,977 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:14:08,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:08,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:08,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:08,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:08,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:08,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:08,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:08,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:08,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:09,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,001 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:14:09,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:09,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:09,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:09,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:09,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:09,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:09,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:09,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:09,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:09,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-12 00:14:09,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,025 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:14:09,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:09,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:09,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:09,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:09,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:09,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:09,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:09,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:09,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:09,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,050 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:14:09,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:09,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:09,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:09,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:09,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:09,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:09,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:09,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:09,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:09,066 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:09,066 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:09,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,067 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:14:09,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:09,069 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:09,069 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:09,069 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-10-12 00:14:09,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 00:14:09,080 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:09,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:09,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:09,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:09,277 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-12 00:14:09,277 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-12 00:14:09,278 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-12 00:14:09,442 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-12 00:14:09,443 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-12 00:14:09,444 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-12 00:14:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2024-10-12 00:14:09,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 43 letters. Loop has 10 letters. [2024-10-12 00:14:09,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:09,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 53 letters. Loop has 10 letters. [2024-10-12 00:14:09,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:09,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 43 letters. Loop has 20 letters. [2024-10-12 00:14:09,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:09,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 3566 transitions. [2024-10-12 00:14:09,457 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 107 [2024-10-12 00:14:09,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1431 states and 2862 transitions. [2024-10-12 00:14:09,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2024-10-12 00:14:09,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2024-10-12 00:14:09,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1431 states and 2862 transitions. [2024-10-12 00:14:09,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:09,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1431 states and 2862 transitions. [2024-10-12 00:14:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states and 2862 transitions. [2024-10-12 00:14:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1145. [2024-10-12 00:14:09,502 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-12 00:14:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2096 transitions. [2024-10-12 00:14:09,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1145 states and 2096 transitions. [2024-10-12 00:14:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 00:14:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:14:09,508 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-12 00:14:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:09,570 INFO L93 Difference]: Finished difference Result 1326 states and 2340 transitions. [2024-10-12 00:14:09,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 2340 transitions. [2024-10-12 00:14:09,577 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 117 [2024-10-12 00:14:09,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1286 states and 2285 transitions. [2024-10-12 00:14:09,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2024-10-12 00:14:09,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2024-10-12 00:14:09,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1286 states and 2285 transitions. [2024-10-12 00:14:09,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:09,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1286 states and 2285 transitions. [2024-10-12 00:14:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states and 2285 transitions. [2024-10-12 00:14:09,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-12 00:14:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1248. [2024-10-12 00:14:09,646 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-12 00:14:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2239 transitions. [2024-10-12 00:14:09,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1248 states and 2239 transitions. [2024-10-12 00:14:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:14:09,651 INFO L425 stractBuchiCegarLoop]: Abstraction has 1248 states and 2239 transitions. [2024-10-12 00:14:09,652 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:14:09,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1248 states and 2239 transitions. [2024-10-12 00:14:09,655 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 114 [2024-10-12 00:14:09,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:09,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:09,656 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-12 00:14:09,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:14:09,656 INFO L745 eck$LassoCheckResult]: Stem: 33449#$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; 33481#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33572#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33573#$Ultimate##0 ~p := #in~p;~q := #in~q; 33575#L20 assume ~p <= 0;#res := 1; 33574#partsFINAL assume true; 33571#partsEXIT >#71#return; 33564#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33561#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33502#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33524#$Ultimate##0 ~p := #in~p;~q := #in~q; 33504#L20 assume ~p <= 0;#res := 1; 33501#partsFINAL assume true; 33503#partsEXIT >#71#return; 33484#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33467#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 33432#L35-3 havoc main_~q~0#1; 33433#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 33635#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 33482#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33483#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33625#$Ultimate##0 ~p := #in~p;~q := #in~q; 33630#L20 assume !(~p <= 0); 33629#L21 assume ~q <= 0;#res := 0; 33487#partsFINAL assume true; 33488#partsEXIT >#71#return; 33604#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33602#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33444#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33599#$Ultimate##0 ~p := #in~p;~q := #in~q; 33996#L20 assume !(~p <= 0); 33994#L21 assume !(~q <= 0); 33991#L22 assume ~q > ~p; 33441#L22-1 call #t~ret0 := parts(~p, ~p);< 33443#$Ultimate##0 ~p := #in~p;~q := #in~q; 33984#L20 assume !(~p <= 0); 33983#L21 assume !(~q <= 0); 33978#L22 assume !(~q > ~p); 33533#L23 call #t~ret1 := parts(~p - ~q, ~q);< 33974#$Ultimate##0 ~p := #in~p;~q := #in~q; 33982#L20 assume ~p <= 0;#res := 1; 33977#partsFINAL assume true; 33973#partsEXIT >#67#return; 33423#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 33969#$Ultimate##0 ~p := #in~p;~q := #in~q; 33970#L20 assume !(~p <= 0); 33980#L21 assume !(~q <= 0); 33430#L22 [2024-10-12 00:14:09,656 INFO L747 eck$LassoCheckResult]: Loop: 33430#L22 assume !(~q > ~p); 33422#L23 call #t~ret1 := parts(~p - ~q, ~q);< 33425#$Ultimate##0 ~p := #in~p;~q := #in~q; 34421#L20 assume !(~p <= 0); 34420#L21 assume !(~q <= 0); 33430#L22 [2024-10-12 00:14:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 813232914, now seen corresponding path program 1 times [2024-10-12 00:14:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9758699] [2024-10-12 00:14:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 00:14:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,703 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-12 00:14:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9758699] [2024-10-12 00:14:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9758699] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945536475] [2024-10-12 00:14:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,705 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-10-12 00:14:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:09,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:09,760 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-12 00:14:09,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:09,796 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-12 00:14:09,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945536475] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:09,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:09,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-10-12 00:14:09,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521885107] [2024-10-12 00:14:09,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:09,797 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 43524783, now seen corresponding path program 2 times [2024-10-12 00:14:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905441623] [2024-10-12 00:14:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:09,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:09,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:09,867 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:09,867 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:09,867 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:09,867 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:09,867 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:09,867 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,867 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:09,867 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:09,867 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2024-10-12 00:14:09,867 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:09,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:09,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,908 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:09,908 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:09,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,909 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:14:09,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:09,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,921 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:09,922 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-12 00:14:09,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,933 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:14:09,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:09,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,945 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:09,945 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-12 00:14:09,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:14:09,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,956 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:14:09,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:09,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:14:09,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,987 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:14:09,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:09,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:16,212 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:16,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:16,219 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:16,219 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:16,219 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:16,219 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:16,219 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:16,219 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:16,219 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:16,219 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:16,219 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2024-10-12 00:14:16,219 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:16,219 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:16,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:16,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:16,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:16,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:16,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:16,264 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:16,264 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:16,266 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:16,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 00:14:16,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:16,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:16,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:16,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:16,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:16,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:16,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:16,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:16,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:16,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:16,283 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:16,284 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:14:16,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:16,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:16,285 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:16,285 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2024-10-12 00:14:16,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-12 00:14:16,296 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:16,484 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-12 00:14:16,484 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-12 00:14:16,547 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-12 00:14:16,548 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-12 00:14:16,548 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-12 00:14:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-10-12 00:14:16,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 51 letters. Loop has 5 letters. [2024-10-12 00:14:16,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:16,549 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:16,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:16,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-12 00:14:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:16,767 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-12 00:14:16,767 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-12 00:14:16,826 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-12 00:14:16,826 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-12 00:14:16,826 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-12 00:14:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-10-12 00:14:16,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 51 letters. Loop has 5 letters. [2024-10-12 00:14:16,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:16,828 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:17,026 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-12 00:14:17,027 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-12 00:14:17,101 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-12 00:14:17,102 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-12 00:14:17,102 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-12 00:14:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2024-10-12 00:14:17,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 51 letters. Loop has 5 letters. [2024-10-12 00:14:17,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:17,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 56 letters. Loop has 5 letters. [2024-10-12 00:14:17,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:17,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 51 letters. Loop has 10 letters. [2024-10-12 00:14:17,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:17,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1957 states and 3620 transitions. [2024-10-12 00:14:17,116 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 129 [2024-10-12 00:14:17,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1957 states to 1570 states and 3178 transitions. [2024-10-12 00:14:17,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2024-10-12 00:14:17,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2024-10-12 00:14:17,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1570 states and 3178 transitions. [2024-10-12 00:14:17,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:17,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1570 states and 3178 transitions. [2024-10-12 00:14:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states and 3178 transitions. [2024-10-12 00:14:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1355. [2024-10-12 00:14:17,172 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-12 00:14:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2392 transitions. [2024-10-12 00:14:17,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1355 states and 2392 transitions. [2024-10-12 00:14:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:17,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 00:14:17,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:14:17,177 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-12 00:14:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:17,261 INFO L93 Difference]: Finished difference Result 1374 states and 2399 transitions. [2024-10-12 00:14:17,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1374 states and 2399 transitions. [2024-10-12 00:14:17,270 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 110 [2024-10-12 00:14:17,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1374 states to 1356 states and 2379 transitions. [2024-10-12 00:14:17,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2024-10-12 00:14:17,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2024-10-12 00:14:17,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1356 states and 2379 transitions. [2024-10-12 00:14:17,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:17,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1356 states and 2379 transitions. [2024-10-12 00:14:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states and 2379 transitions. [2024-10-12 00:14:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1327. [2024-10-12 00:14:17,335 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-12 00:14:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2335 transitions. [2024-10-12 00:14:17,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1327 states and 2335 transitions. [2024-10-12 00:14:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:14:17,341 INFO L425 stractBuchiCegarLoop]: Abstraction has 1327 states and 2335 transitions. [2024-10-12 00:14:17,341 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 00:14:17,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1327 states and 2335 transitions. [2024-10-12 00:14:17,346 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2024-10-12 00:14:17,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:17,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:17,346 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-12 00:14:17,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:17,347 INFO L745 eck$LassoCheckResult]: Stem: 42925#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 42884#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; 42885#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; 42882#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; 42883#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42958#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 43054#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43055#$Ultimate##0 ~p := #in~p;~q := #in~q; 43057#L20 assume ~p <= 0;#res := 1; 43056#partsFINAL assume true; 43053#partsEXIT >#71#return; 43041#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43038#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42982#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43002#$Ultimate##0 ~p := #in~p;~q := #in~q; 42984#L20 assume ~p <= 0;#res := 1; 42981#partsFINAL assume true; 42983#partsEXIT >#71#return; 42963#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42964#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 42898#L35-3 havoc main_~q~0#1; 42899#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42961#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42962#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42886#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 42887#$Ultimate##0 ~p := #in~p;~q := #in~q; 43148#L20 assume !(~p <= 0); 43144#L21 assume ~q <= 0;#res := 0; 43140#partsFINAL assume true; 42965#partsEXIT >#71#return; 42966#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43112#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 43108#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43109#$Ultimate##0 ~p := #in~p;~q := #in~q; 43161#L20 assume !(~p <= 0); 43159#L21 assume !(~q <= 0); 43157#L22 assume !(~q > ~p); 43154#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43155#$Ultimate##0 ~p := #in~p;~q := #in~q; 43163#L20 assume ~p <= 0;#res := 1; 43162#partsFINAL assume true; 43153#partsEXIT >#67#return; 43121#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43124#$Ultimate##0 ~p := #in~p;~q := #in~q; 43165#L20 assume !(~p <= 0); 43164#L21 assume ~q <= 0;#res := 0; 43141#partsFINAL assume true; 43120#partsEXIT >#69#return; 43114#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 43111#partsFINAL assume true; 43107#partsEXIT >#71#return; 43039#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43040#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42973#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 42980#$Ultimate##0 ~p := #in~p;~q := #in~q; 43042#L20 assume !(~p <= 0); 43007#L21 assume !(~q <= 0); 43008#L22 assume ~q > ~p; 42989#L22-1 call #t~ret0 := parts(~p, ~p);< 43001#$Ultimate##0 ~p := #in~p;~q := #in~q; 43728#L20 assume !(~p <= 0); 43727#L21 assume !(~q <= 0); 43600#L22 assume !(~q > ~p); 43567#L23 [2024-10-12 00:14:17,347 INFO L747 eck$LassoCheckResult]: Loop: 43567#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43598#$Ultimate##0 ~p := #in~p;~q := #in~q; 43606#L20 assume ~p <= 0;#res := 1; 43605#partsFINAL assume true; 43597#partsEXIT >#67#return; 43014#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43596#$Ultimate##0 ~p := #in~p;~q := #in~q; 43595#L20 assume !(~p <= 0); 43593#L21 assume !(~q <= 0); 43566#L22 assume !(~q > ~p); 43567#L23 [2024-10-12 00:14:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1115927007, now seen corresponding path program 1 times [2024-10-12 00:14:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760633717] [2024-10-12 00:14:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 00:14:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,421 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-12 00:14:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760633717] [2024-10-12 00:14:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760633717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792356923] [2024-10-12 00:14:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:17,423 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:17,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-10-12 00:14:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:17,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:17,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:17,515 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-12 00:14:17,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:17,573 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-12 00:14:17,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792356923] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:17,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-10-12 00:14:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880599850] [2024-10-12 00:14:17,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:17,576 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:17,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -172323367, now seen corresponding path program 2 times [2024-10-12 00:14:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069077225] [2024-10-12 00:14:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:17,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:17,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:17,694 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:17,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:17,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:17,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:17,694 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:17,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:17,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:17,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:17,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2024-10-12 00:14:17,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:17,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:17,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:17,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:17,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:17,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:17,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:17,750 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:17,751 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:17,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:17,752 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:17,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-12 00:14:17,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:17,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:17,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-12 00:14:17,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:17,787 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:17,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-12 00:14:17,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:17,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:18,416 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:18,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:18,424 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:18,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:18,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:18,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:18,424 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:18,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:18,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:18,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:18,424 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2024-10-12 00:14:18,424 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:18,424 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:18,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:18,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:18,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:18,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:18,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:18,474 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:18,474 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:18,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:18,475 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:18,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-12 00:14:18,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:18,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:18,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:18,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:18,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:18,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:18,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:18,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:18,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:18,493 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:18,493 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:18,494 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:18,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-12 00:14:18,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:18,495 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:18,495 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:18,495 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2024-10-12 00:14:18,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-12 00:14:18,506 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:14:18,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:18,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:18,810 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-12 00:14:18,811 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-12 00:14:18,811 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-12 00:14:18,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-12 00:14:18,951 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-12 00:14:18,952 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-12 00:14:18,952 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-12 00:14:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-10-12 00:14:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 63 letters. Loop has 10 letters. [2024-10-12 00:14:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:18,953 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:18,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:19,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:14:19,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:19,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:19,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:19,270 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-12 00:14:19,271 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-12 00:14:19,271 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-12 00:14:19,387 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-12 00:14:19,387 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-12 00:14:19,388 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-12 00:14:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2024-10-12 00:14:19,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 63 letters. Loop has 10 letters. [2024-10-12 00:14:19,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:19,388 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:19,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:19,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:14:19,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:19,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:19,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:19,681 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-12 00:14:19,682 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-12 00:14:19,682 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-12 00:14:19,859 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-12 00:14:19,860 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-12 00:14:19,862 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-12 00:14:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2024-10-12 00:14:19,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 63 letters. Loop has 10 letters. [2024-10-12 00:14:19,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:19,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 73 letters. Loop has 10 letters. [2024-10-12 00:14:19,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:19,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 63 letters. Loop has 20 letters. [2024-10-12 00:14:19,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:19,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9334 states and 15635 transitions. [2024-10-12 00:14:19,916 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2024-10-12 00:14:19,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9334 states to 5775 states and 10049 transitions. [2024-10-12 00:14:19,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2024-10-12 00:14:19,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2024-10-12 00:14:19,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5775 states and 10049 transitions. [2024-10-12 00:14:19,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:19,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5775 states and 10049 transitions. [2024-10-12 00:14:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states and 10049 transitions. [2024-10-12 00:14:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4678. [2024-10-12 00:14:20,069 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-12 00:14:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 7690 transitions. [2024-10-12 00:14:20,084 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4678 states and 7690 transitions. [2024-10-12 00:14:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:14:20,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:14:20,085 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-12 00:14:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:20,176 INFO L93 Difference]: Finished difference Result 4727 states and 7780 transitions. [2024-10-12 00:14:20,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4727 states and 7780 transitions. [2024-10-12 00:14:20,197 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 154 [2024-10-12 00:14:20,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4727 states to 4711 states and 7761 transitions. [2024-10-12 00:14:20,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2024-10-12 00:14:20,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2024-10-12 00:14:20,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4711 states and 7761 transitions. [2024-10-12 00:14:20,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:20,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4711 states and 7761 transitions. [2024-10-12 00:14:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states and 7761 transitions. [2024-10-12 00:14:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4681. [2024-10-12 00:14:20,305 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-12 00:14:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 7694 transitions. [2024-10-12 00:14:20,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4681 states and 7694 transitions. [2024-10-12 00:14:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:14:20,323 INFO L425 stractBuchiCegarLoop]: Abstraction has 4681 states and 7694 transitions. [2024-10-12 00:14:20,323 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-12 00:14:20,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4681 states and 7694 transitions. [2024-10-12 00:14:20,332 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 141 [2024-10-12 00:14:20,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:20,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:20,333 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-12 00:14:20,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:20,334 INFO L745 eck$LassoCheckResult]: Stem: 72523#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 72475#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; 72476#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; 72473#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; 72474#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72544#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74492#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 74493#$Ultimate##0 ~p := #in~p;~q := #in~q; 74495#L20 assume ~p <= 0;#res := 1; 74494#partsFINAL assume true; 74491#partsEXIT >#71#return; 74490#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74488#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74486#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72583#$Ultimate##0 ~p := #in~p;~q := #in~q; 74489#L20 assume ~p <= 0;#res := 1; 74487#partsFINAL assume true; 74485#partsEXIT >#71#return; 74391#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74388#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72560#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72571#$Ultimate##0 ~p := #in~p;~q := #in~q; 72568#L20 assume ~p <= 0;#res := 1; 72569#partsFINAL assume true; 72559#partsEXIT >#71#return; 72547#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72548#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 72499#L35-3 havoc main_~q~0#1; 72500#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72549#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72550#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72477#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72478#$Ultimate##0 ~p := #in~p;~q := #in~q; 72558#L20 assume !(~p <= 0); 72554#L21 assume ~q <= 0;#res := 0; 72555#partsFINAL assume true; 72551#partsEXIT >#71#return; 72537#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72538#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74530#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 74563#$Ultimate##0 ~p := #in~p;~q := #in~q; 74571#L20 assume !(~p <= 0); 74568#L21 assume !(~q <= 0); 74569#L22 assume !(~q > ~p); 74605#L23 call #t~ret1 := parts(~p - ~q, ~q);< 77123#$Ultimate##0 ~p := #in~p;~q := #in~q; 77129#L20 assume ~p <= 0;#res := 1; 77128#partsFINAL assume true; 77122#partsEXIT >#67#return; 77107#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 77118#$Ultimate##0 ~p := #in~p;~q := #in~q; 77106#L20 assume !(~p <= 0); 77108#L21 assume ~q <= 0;#res := 0; 77133#partsFINAL assume true; 77117#partsEXIT >#69#return; 77115#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 77112#partsFINAL assume true; 77109#partsEXIT >#71#return; 74004#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74003#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);< 72562#$Ultimate##0 ~p := #in~p;~q := #in~q; 72673#L20 assume !(~p <= 0); 72672#L21 assume !(~q <= 0); 72626#L22 assume !(~q > ~p); 72621#L23 call #t~ret1 := parts(~p - ~q, ~q);< 73034#$Ultimate##0 ~p := #in~p;~q := #in~q; 73035#L20 assume !(~p <= 0); 73012#L21 assume !(~q <= 0); 73013#L22 assume !(~q > ~p); 73103#L23 [2024-10-12 00:14:20,334 INFO L747 eck$LassoCheckResult]: Loop: 73103#L23 call #t~ret1 := parts(~p - ~q, ~q);< 73105#$Ultimate##0 ~p := #in~p;~q := #in~q; 73109#L20 assume ~p <= 0;#res := 1; 73107#partsFINAL assume true; 73102#partsEXIT >#67#return; 72969#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 73101#$Ultimate##0 ~p := #in~p;~q := #in~q; 73027#L20 assume !(~p <= 0); 73028#L21 assume !(~q <= 0); 72970#L22 assume !(~q > ~p); 72762#L23 call #t~ret1 := parts(~p - ~q, ~q);< 73034#$Ultimate##0 ~p := #in~p;~q := #in~q; 73035#L20 assume !(~p <= 0); 73012#L21 assume !(~q <= 0); 73013#L22 assume !(~q > ~p); 73103#L23 [2024-10-12 00:14:20,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash 34537157, now seen corresponding path program 1 times [2024-10-12 00:14:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985420582] [2024-10-12 00:14:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,426 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-12 00:14:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985420582] [2024-10-12 00:14:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985420582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705982961] [2024-10-12 00:14:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:20,427 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:20,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-10-12 00:14:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:20,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:20,554 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-12 00:14:20,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:20,641 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-12 00:14:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705982961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:20,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-12 00:14:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523685550] [2024-10-12 00:14:20,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:20,642 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:20,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1614589677, now seen corresponding path program 3 times [2024-10-12 00:14:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206109678] [2024-10-12 00:14:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:20,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:20,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:20,818 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:20,818 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:20,819 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:20,819 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:20,819 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:20,819 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:20,819 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:20,819 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:20,819 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2024-10-12 00:14:20,819 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:20,819 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:20,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:20,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:20,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:20,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:20,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:20,867 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:20,867 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:20,869 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:20,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-12 00:14:20,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:20,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:20,881 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:20,882 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:20,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-12 00:14:20,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:20,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:20,894 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:20,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-12 00:14:20,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:20,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:20,907 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:20,907 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-12 00:14:20,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-12 00:14:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:20,918 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:20,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-12 00:14:20,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:20,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:20,929 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:20,930 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-12 00:14:20,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-12 00:14:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:20,941 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:20,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-12 00:14:20,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:20,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:20,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-12 00:14:20,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:20,972 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:20,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-12 00:14:20,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:20,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,434 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:24,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-12 00:14:24,441 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:24,441 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:24,441 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:24,441 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:24,441 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:24,441 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,441 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:24,441 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:24,441 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2024-10-12 00:14:24,441 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:24,441 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:24,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,495 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:24,495 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:24,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,497 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-12 00:14:24,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,521 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-12 00:14:24,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-12 00:14:24,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,544 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-12 00:14:24,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-10-12 00:14:24,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,568 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-12 00:14:24,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-12 00:14:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,591 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-12 00:14:24,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:24,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:24,608 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,610 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-12 00:14:24,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:24,611 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:24,612 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:24,612 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2024-10-12 00:14:24,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:24,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:14:24,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:24,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:24,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:24,932 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-12 00:14:24,933 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-12 00:14:24,933 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-12 00:14:25,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-12 00:14:25,335 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-12 00:14:25,336 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-12 00:14:25,336 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-12 00:14:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2024-10-12 00:14:25,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 70 letters. Loop has 15 letters. [2024-10-12 00:14:25,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,337 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:25,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,649 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-12 00:14:25,649 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-12 00:14:25,650 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-12 00:14:25,952 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-12 00:14:25,953 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-12 00:14:25,954 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-12 00:14:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2024-10-12 00:14:25,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 70 letters. Loop has 15 letters. [2024-10-12 00:14:25,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,954 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:25,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,281 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-12 00:14:26,281 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-12 00:14:26,281 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-12 00:14:26,874 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-12 00:14:26,878 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-12 00:14:26,878 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-12 00:14:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2024-10-12 00:14:26,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 70 letters. Loop has 15 letters. [2024-10-12 00:14:26,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 85 letters. Loop has 15 letters. [2024-10-12 00:14:26,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 70 letters. Loop has 30 letters. [2024-10-12 00:14:26,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39830 states and 67154 transitions. [2024-10-12 00:14:27,242 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 176 [2024-10-12 00:14:27,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39830 states to 15617 states and 27516 transitions. [2024-10-12 00:14:27,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2024-10-12 00:14:27,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 609 [2024-10-12 00:14:27,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 27516 transitions. [2024-10-12 00:14:27,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:27,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15617 states and 27516 transitions. [2024-10-12 00:14:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 27516 transitions. [2024-10-12 00:14:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 12095. [2024-10-12 00:14:27,814 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-12 00:14:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 19046 transitions. [2024-10-12 00:14:27,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12095 states and 19046 transitions. [2024-10-12 00:14:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:14:27,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:14:27,866 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-12 00:14:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:28,064 INFO L93 Difference]: Finished difference Result 10330 states and 15945 transitions. [2024-10-12 00:14:28,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10330 states and 15945 transitions. [2024-10-12 00:14:28,228 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 119 [2024-10-12 00:14:28,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10330 states to 10330 states and 15945 transitions. [2024-10-12 00:14:28,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2024-10-12 00:14:28,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2024-10-12 00:14:28,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10330 states and 15945 transitions. [2024-10-12 00:14:28,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:28,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10330 states and 15945 transitions. [2024-10-12 00:14:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10330 states and 15945 transitions. [2024-10-12 00:14:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10330 to 10303. [2024-10-12 00:14:28,547 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-12 00:14:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10303 states to 10303 states and 15886 transitions. [2024-10-12 00:14:28,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10303 states and 15886 transitions. [2024-10-12 00:14:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:14:28,583 INFO L425 stractBuchiCegarLoop]: Abstraction has 10303 states and 15886 transitions. [2024-10-12 00:14:28,583 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-12 00:14:28,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10303 states and 15886 transitions. [2024-10-12 00:14:28,602 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 119 [2024-10-12 00:14:28,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:28,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:28,602 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-12 00:14:28,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:14:28,603 INFO L745 eck$LassoCheckResult]: Stem: 177837#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 177786#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; 177787#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; 177784#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; 177785#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 177853#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177909#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177910#$Ultimate##0 ~p := #in~p;~q := #in~q; 177912#L20 assume ~p <= 0;#res := 1; 177911#partsFINAL assume true; 177908#partsEXIT >#71#return; 177907#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177904#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177900#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177901#$Ultimate##0 ~p := #in~p;~q := #in~q; 177906#L20 assume ~p <= 0;#res := 1; 177903#partsFINAL assume true; 177899#partsEXIT >#71#return; 177881#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177880#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177875#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177878#$Ultimate##0 ~p := #in~p;~q := #in~q; 177874#L20 assume ~p <= 0;#res := 1; 177876#partsFINAL assume true; 177913#partsEXIT >#71#return; 177914#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178160#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 178158#L35-3 havoc main_~q~0#1; 177799#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 177800#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 177854#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);< 177865#$Ultimate##0 ~p := #in~p;~q := #in~q; 177864#L20 assume !(~p <= 0); 177863#L21 assume ~q <= 0;#res := 0; 177861#partsFINAL assume true; 177862#partsEXIT >#71#return; 177846#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177847#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177790#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177791#$Ultimate##0 ~p := #in~p;~q := #in~q; 178220#L20 assume !(~p <= 0); 178200#L21 assume ~q <= 0;#res := 0; 178201#partsFINAL assume true; 179046#partsEXIT >#71#return; 177848#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177839#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177840#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178129#$Ultimate##0 ~p := #in~p;~q := #in~q; 179094#L20 assume !(~p <= 0); 179093#L21 assume !(~q <= 0); 179092#L22 assume ~q > ~p; 178034#L22-1 call #t~ret0 := parts(~p, ~p);< 179089#$Ultimate##0 ~p := #in~p;~q := #in~q; 179090#L20 assume !(~p <= 0); 180044#L21 assume !(~q <= 0); 179949#L22 assume !(~q > ~p); 178136#L23 call #t~ret1 := parts(~p - ~q, ~q);< 178137#$Ultimate##0 ~p := #in~p;~q := #in~q; 179815#L20 assume ~p <= 0;#res := 1; 179814#partsFINAL assume true; 179427#partsEXIT >#67#return; 178102#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 178132#$Ultimate##0 ~p := #in~p;~q := #in~q; 178157#L20 assume !(~p <= 0); 178156#L21 assume ~q <= 0;#res := 0; 178131#partsFINAL assume true; 178101#partsEXIT >#69#return; 178090#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 178085#partsFINAL assume true; 178025#partsEXIT >#65#return; 178037#L22-2 #res := #t~ret0;havoc #t~ret0; 178133#partsFINAL assume true; 178128#partsEXIT >#71#return; 178076#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178075#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177944#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178072#$Ultimate##0 ~p := #in~p;~q := #in~q; 178070#L20 assume !(~p <= 0); 178010#L21 assume !(~q <= 0); 177943#L22 assume ~q > ~p; 177883#L22-1 call #t~ret0 := parts(~p, ~p);< 177938#$Ultimate##0 [2024-10-12 00:14:28,603 INFO L747 eck$LassoCheckResult]: Loop: 177938#$Ultimate##0 ~p := #in~p;~q := #in~q; 177936#L20 assume !(~p <= 0); 177934#L21 assume !(~q <= 0); 177930#L22 assume ~q > ~p; 177891#L22-1 call #t~ret0 := parts(~p, ~p);< 177938#$Ultimate##0 [2024-10-12 00:14:28,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash -9765940, now seen corresponding path program 1 times [2024-10-12 00:14:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503668422] [2024-10-12 00:14:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 00:14:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,680 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-12 00:14:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503668422] [2024-10-12 00:14:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503668422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255888043] [2024-10-12 00:14:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:28,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:28,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,683 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-10-12 00:14:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,742 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-12 00:14:28,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:14:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255888043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:28,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:14:28,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-10-12 00:14:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121945593] [2024-10-12 00:14:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:28,743 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:28,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 28756408, now seen corresponding path program 2 times [2024-10-12 00:14:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43992632] [2024-10-12 00:14:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:28,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:28,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:28,781 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:28,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:28,781 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:28,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:28,781 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:28,781 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,781 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:28,781 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:28,781 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2024-10-12 00:14:28,781 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:28,781 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:28,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,811 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:28,811 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,812 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-12 00:14:28,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,824 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:28,824 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-12 00:14:28,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-10-12 00:14:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,835 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-12 00:14:28,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,846 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:28,846 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:28,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-10-12 00:14:28,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,858 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-12 00:14:28,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,869 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:28,870 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-12 00:14:28,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-12 00:14:28,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,880 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-12 00:14:28,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,891 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:28,892 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:28,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-12 00:14:28,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,902 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-12 00:14:28,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,933 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-12 00:14:28,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:28,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,969 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:28,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-12 00:14:28,973 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:28,973 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:28,973 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:28,973 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:28,973 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:28,973 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,973 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:28,973 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:28,973 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2024-10-12 00:14:28,973 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:28,973 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:28,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:29,004 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:29,004 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:29,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,005 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-12 00:14:29,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:29,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:29,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:29,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:29,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:29,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:29,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:29,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:29,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:29,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-12 00:14:29,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:29,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,028 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-12 00:14:29,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:29,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:29,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:29,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:29,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:29,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:29,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:29,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:29,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:29,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-12 00:14:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,051 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-12 00:14:29,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:29,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:29,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:29,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:29,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:29,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:29,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:29,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:29,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:29,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-12 00:14:29,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:29,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,073 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-12 00:14:29,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:29,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:29,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:29,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:29,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:29,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:29,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:29,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:29,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:29,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-12 00:14:29,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:29,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,096 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-12 00:14:29,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:29,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:29,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:29,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:29,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:29,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:29,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:29,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:29,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:29,112 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:29,112 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:29,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:29,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,114 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-12 00:14:29,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:29,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:29,116 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:29,116 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-10-12 00:14:29,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-12 00:14:29,126 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:29,470 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-12 00:14:29,470 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-12 00:14:29,592 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-12 00:14:29,593 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-12 00:14:29,593 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-12 00:14:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-10-12 00:14:29,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 82 letters. Loop has 5 letters. [2024-10-12 00:14:29,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:29,594 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:30,015 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-12 00:14:30,015 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-12 00:14:30,154 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-12 00:14:30,155 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-12 00:14:30,155 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-12 00:14:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-10-12 00:14:30,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 82 letters. Loop has 5 letters. [2024-10-12 00:14:30,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:30,156 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:30,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:14:30,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:30,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:30,523 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-12 00:14:30,523 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-12 00:14:30,743 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-12 00:14:30,743 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-12 00:14:30,744 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-12 00:14:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2024-10-12 00:14:30,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 82 letters. Loop has 5 letters. [2024-10-12 00:14:30,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:30,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 87 letters. Loop has 5 letters. [2024-10-12 00:14:30,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:30,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 82 letters. Loop has 10 letters. [2024-10-12 00:14:30,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:30,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21413 states and 31115 transitions. [2024-10-12 00:14:30,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2024-10-12 00:14:30,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21413 states to 11927 states and 19027 transitions. [2024-10-12 00:14:30,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2024-10-12 00:14:30,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2024-10-12 00:14:30,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11927 states and 19027 transitions. [2024-10-12 00:14:30,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:30,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11927 states and 19027 transitions. [2024-10-12 00:14:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11927 states and 19027 transitions. [2024-10-12 00:14:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11927 to 7997. [2024-10-12 00:14:31,094 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-12 00:14:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 12024 transitions. [2024-10-12 00:14:31,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7997 states and 12024 transitions. [2024-10-12 00:14:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:31,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:14:31,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:14:31,119 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-12 00:14:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:31,186 INFO L93 Difference]: Finished difference Result 4190 states and 6496 transitions. [2024-10-12 00:14:31,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4190 states and 6496 transitions. [2024-10-12 00:14:31,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-12 00:14:31,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4190 states to 4106 states and 6348 transitions. [2024-10-12 00:14:31,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2024-10-12 00:14:31,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2024-10-12 00:14:31,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4106 states and 6348 transitions. [2024-10-12 00:14:31,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:31,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4106 states and 6348 transitions. [2024-10-12 00:14:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states and 6348 transitions. [2024-10-12 00:14:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4045. [2024-10-12 00:14:31,298 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-12 00:14:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 6139 transitions. [2024-10-12 00:14:31,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4045 states and 6139 transitions. [2024-10-12 00:14:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:14:31,312 INFO L425 stractBuchiCegarLoop]: Abstraction has 4045 states and 6139 transitions. [2024-10-12 00:14:31,313 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-12 00:14:31,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4045 states and 6139 transitions. [2024-10-12 00:14:31,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-12 00:14:31,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:31,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:31,323 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-12 00:14:31,323 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-12 00:14:31,324 INFO L745 eck$LassoCheckResult]: Stem: 254642#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 254601#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; 254602#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; 254594#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; 254595#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254671#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254708#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254709#$Ultimate##0 ~p := #in~p;~q := #in~q; 254711#L20 assume ~p <= 0;#res := 1; 254710#partsFINAL assume true; 254707#partsEXIT >#71#return; 254706#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254704#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254701#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254702#$Ultimate##0 ~p := #in~p;~q := #in~q; 254713#L20 assume ~p <= 0;#res := 1; 254712#partsFINAL assume true; 254700#partsEXIT >#71#return; 254698#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254697#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254691#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254695#$Ultimate##0 ~p := #in~p;~q := #in~q; 254690#L20 assume ~p <= 0;#res := 1; 254692#partsFINAL assume true; 254731#partsEXIT >#71#return; 254732#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254807#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 254621#L35-3 havoc main_~q~0#1; 254622#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 254801#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254799#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254596#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254597#$Ultimate##0 ~p := #in~p;~q := #in~q; 254806#L20 assume !(~p <= 0); 254805#L21 assume ~q <= 0;#res := 0; 254804#partsFINAL assume true; 254675#partsEXIT >#71#return; 254676#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254775#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254741#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254744#$Ultimate##0 ~p := #in~p;~q := #in~q; 254850#L20 assume !(~p <= 0); 254844#L21 assume !(~q <= 0); 254840#L22 assume !(~q > ~p); 254841#L23 call #t~ret1 := parts(~p - ~q, ~q);< 255070#$Ultimate##0 ~p := #in~p;~q := #in~q; 255079#L20 assume ~p <= 0;#res := 1; 255077#partsFINAL assume true; 255069#partsEXIT >#67#return; 255052#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 255053#$Ultimate##0 ~p := #in~p;~q := #in~q; 255075#L20 assume !(~p <= 0); 255065#L21 assume ~q <= 0;#res := 0; 255064#partsFINAL assume true; 255051#partsEXIT >#69#return; 255039#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 255032#partsFINAL assume true; 254740#partsEXIT >#71#return; 254742#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 256555#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254678#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254599#$Ultimate##0 ~p := #in~p;~q := #in~q; 254738#L20 assume !(~p <= 0); 254739#L21 assume !(~q <= 0); 254733#L22 assume ~q > ~p; 254723#L22-1 call #t~ret0 := parts(~p, ~p);< 256811#$Ultimate##0 ~p := #in~p;~q := #in~q; 256812#L20 assume !(~p <= 0); 257023#L21 assume !(~q <= 0); 257021#L22 assume !(~q > ~p); 257014#L23 call #t~ret1 := parts(~p - ~q, ~q);< 257018#$Ultimate##0 ~p := #in~p;~q := #in~q; 257314#L20 assume ~p <= 0;#res := 1; 257312#partsFINAL assume true; 257235#partsEXIT >#67#return; 257164#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 257173#$Ultimate##0 ~p := #in~p;~q := #in~q; 257441#L20 assume !(~p <= 0); 257439#L21 assume ~q <= 0;#res := 0; 257436#partsFINAL assume true; 257163#partsEXIT >#69#return; 257162#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 256632#partsFINAL assume true; 254714#partsEXIT >#65#return; 254693#L22-2 #res := #t~ret0;havoc #t~ret0; 254694#partsFINAL assume true; 254677#partsEXIT >#71#return; 254674#L36-1 [2024-10-12 00:14:31,324 INFO L747 eck$LassoCheckResult]: Loop: 254674#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254653#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 254654#L35-3 havoc main_~q~0#1; 254610#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 254611#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254672#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254673#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254686#$Ultimate##0 ~p := #in~p;~q := #in~q; 254685#L20 assume !(~p <= 0); 254684#L21 assume ~q <= 0;#res := 0; 254682#partsFINAL assume true; 254683#partsEXIT >#71#return; 254663#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254664#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254745#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254762#$Ultimate##0 ~p := #in~p;~q := #in~q; 254797#L20 assume !(~p <= 0); 254796#L21 assume !(~q <= 0); 254793#L22 assume !(~q > ~p); 254790#L23 call #t~ret1 := parts(~p - ~q, ~q);< 254791#$Ultimate##0 ~p := #in~p;~q := #in~q; 254800#L20 assume ~p <= 0;#res := 1; 254798#partsFINAL assume true; 254789#partsEXIT >#67#return; 254771#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 254772#$Ultimate##0 ~p := #in~p;~q := #in~q; 254795#L20 assume !(~p <= 0); 254792#L21 assume ~q <= 0;#res := 0; 254776#partsFINAL assume true; 254769#partsEXIT >#69#return; 254767#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 254765#partsFINAL assume true; 254764#partsEXIT >#71#return; 254754#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254752#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254688#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254749#$Ultimate##0 ~p := #in~p;~q := #in~q; 254828#L20 assume !(~p <= 0); 254827#L21 assume !(~q <= 0); 254824#L22 assume ~q > ~p; 254719#L22-1 call #t~ret0 := parts(~p, ~p);< 254730#$Ultimate##0 ~p := #in~p;~q := #in~q; 256816#L20 assume !(~p <= 0); 256913#L21 assume !(~q <= 0); 256911#L22 assume !(~q > ~p); 256903#L23 call #t~ret1 := parts(~p - ~q, ~q);< 256906#$Ultimate##0 ~p := #in~p;~q := #in~q; 257311#L20 assume ~p <= 0;#res := 1; 257304#partsFINAL assume true; 257234#partsEXIT >#67#return; 257164#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 257173#$Ultimate##0 ~p := #in~p;~q := #in~q; 257441#L20 assume !(~p <= 0); 257439#L21 assume ~q <= 0;#res := 0; 257436#partsFINAL assume true; 257163#partsEXIT >#69#return; 257162#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 256632#partsFINAL assume true; 254714#partsEXIT >#65#return; 254729#L22-2 #res := #t~ret0;havoc #t~ret0; 254687#partsFINAL assume true; 254689#partsEXIT >#71#return; 254674#L36-1 [2024-10-12 00:14:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 2 times [2024-10-12 00:14:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686280659] [2024-10-12 00:14:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:31,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:31,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:31,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -96725577, now seen corresponding path program 1 times [2024-10-12 00:14:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588115802] [2024-10-12 00:14:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:31,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:31,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:31,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1897649466, now seen corresponding path program 3 times [2024-10-12 00:14:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770068353] [2024-10-12 00:14:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 00:14:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 00:14:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 00:14:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 00:14:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,598 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-12 00:14:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770068353] [2024-10-12 00:14:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770068353] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627223053] [2024-10-12 00:14:31,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,600 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-10-12 00:14:31,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-12 00:14:31,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:31,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,751 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-12 00:14:31,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:31,989 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-12 00:14:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627223053] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:31,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2024-10-12 00:14:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313831299] [2024-10-12 00:14:31,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:32,409 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:32,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:32,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:32,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:32,409 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:32,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:32,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:32,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2024-10-12 00:14:32,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:32,409 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:32,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,435 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:32,435 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:32,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,436 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-12 00:14:32,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:32,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:32,455 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:32,455 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-12 00:14:32,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-10-12 00:14:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,465 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-12 00:14:32,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:32,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:32,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-12 00:14:32,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,488 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-12 00:14:32,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:32,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:32,501 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:32,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:32,511 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:32,511 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:32,511 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:32,511 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:32,511 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:32,511 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,511 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:32,511 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:32,511 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2024-10-12 00:14:32,511 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:32,511 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:32,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:32,547 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:32,548 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:32,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,549 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-12 00:14:32,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-12 00:14:32,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,573 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-12 00:14:32,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-12 00:14:32,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,597 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-12 00:14:32,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-12 00:14:32,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,620 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-12 00:14:32,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:32,635 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:32,635 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:32,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,636 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-12 00:14:32,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:32,637 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:32,638 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:32,638 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-12 00:14:32,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-10-12 00:14:32,647 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:32,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:14:32,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:33,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:33,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:33,196 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-12 00:14:33,197 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-12 00:14:33,197 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-12 00:14:33,448 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-12 00:14:33,449 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-12 00:14:33,449 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-12 00:14:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2024-10-12 00:14:33,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 87 letters. Loop has 62 letters. [2024-10-12 00:14:33,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 149 letters. Loop has 62 letters. [2024-10-12 00:14:33,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 87 letters. Loop has 124 letters. [2024-10-12 00:14:33,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9389 states and 14758 transitions. [2024-10-12 00:14:33,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-10-12 00:14:33,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9389 states to 9336 states and 14686 transitions. [2024-10-12 00:14:33,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2024-10-12 00:14:33,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2024-10-12 00:14:33,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9336 states and 14686 transitions. [2024-10-12 00:14:33,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:33,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9336 states and 14686 transitions. [2024-10-12 00:14:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states and 14686 transitions. [2024-10-12 00:14:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 8436. [2024-10-12 00:14:33,660 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-12 00:14:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 12198 transitions. [2024-10-12 00:14:33,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8436 states and 12198 transitions. [2024-10-12 00:14:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 00:14:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-12 00:14:33,684 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-12 00:14:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:33,986 INFO L93 Difference]: Finished difference Result 7265 states and 10824 transitions. [2024-10-12 00:14:33,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7265 states and 10824 transitions. [2024-10-12 00:14:34,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-10-12 00:14:34,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7265 states to 3744 states and 5610 transitions. [2024-10-12 00:14:34,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2024-10-12 00:14:34,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2024-10-12 00:14:34,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3744 states and 5610 transitions. [2024-10-12 00:14:34,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-10-12 00:14:34,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:34,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3744 states and 5610 transitions. [2024-10-12 00:14:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states and 5610 transitions. [2024-10-12 00:14:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3499. [2024-10-12 00:14:34,175 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-12 00:14:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5000 transitions. [2024-10-12 00:14:34,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3499 states and 5000 transitions. [2024-10-12 00:14:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 00:14:34,184 INFO L425 stractBuchiCegarLoop]: Abstraction has 3499 states and 5000 transitions. [2024-10-12 00:14:34,184 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-12 00:14:34,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3499 states and 5000 transitions. [2024-10-12 00:14:34,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2024-10-12 00:14:34,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:34,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:34,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 18, 13, 12, 11, 11, 11, 11, 11, 11, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:34,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 22, 14, 11, 11, 11, 11, 11, 11, 8, 7, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2024-10-12 00:14:34,192 INFO L745 eck$LassoCheckResult]: Stem: 285464#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 285399#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; 285400#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; 285392#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; 285393#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285508#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);< 285506#$Ultimate##0 ~p := #in~p;~q := #in~q; 285509#L20 assume ~p <= 0;#res := 1; 285507#partsFINAL assume true; 285504#partsEXIT >#71#return; 285502#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285499#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285494#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285496#$Ultimate##0 ~p := #in~p;~q := #in~q; 285500#L20 assume ~p <= 0;#res := 1; 285497#partsFINAL assume true; 285493#partsEXIT >#71#return; 285492#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285490#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285486#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285487#$Ultimate##0 ~p := #in~p;~q := #in~q; 285491#L20 assume ~p <= 0;#res := 1; 285489#partsFINAL assume true; 285485#partsEXIT >#71#return; 285484#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285483#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 285428#L35-3 havoc main_~q~0#1; 285410#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285411#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285482#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285948#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285949#$Ultimate##0 ~p := #in~p;~q := #in~q; 285959#L20 assume !(~p <= 0); 285957#L21 assume ~q <= 0;#res := 0; 285955#partsFINAL assume true; 285947#partsEXIT >#71#return; 285943#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285941#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285938#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285939#$Ultimate##0 ~p := #in~p;~q := #in~q; 285960#L20 assume !(~p <= 0); 285958#L21 assume !(~q <= 0); 285956#L22 assume !(~q > ~p); 285953#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285954#$Ultimate##0 ~p := #in~p;~q := #in~q; 285963#L20 assume ~p <= 0;#res := 1; 285962#partsFINAL assume true; 285952#partsEXIT >#67#return; 285945#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285946#$Ultimate##0 ~p := #in~p;~q := #in~q; 285961#L20 assume !(~p <= 0); 285951#L21 assume ~q <= 0;#res := 0; 285950#partsFINAL assume true; 285944#partsEXIT >#69#return; 285942#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285940#partsFINAL assume true; 285937#partsEXIT >#71#return; 285936#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285935#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285929#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285933#$Ultimate##0 ~p := #in~p;~q := #in~q; 285932#L20 assume !(~p <= 0); 285931#L21 assume !(~q <= 0); 285930#L22 assume ~q > ~p; 285547#L22-1 call #t~ret0 := parts(~p, ~p);< 285605#$Ultimate##0 ~p := #in~p;~q := #in~q; 285606#L20 assume !(~p <= 0); 285649#L21 assume !(~q <= 0); 285650#L22 assume !(~q > ~p); 285844#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285972#$Ultimate##0 ~p := #in~p;~q := #in~q; 285977#L20 assume ~p <= 0;#res := 1; 285843#partsFINAL assume true; 285845#partsEXIT >#67#return; 285771#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285828#$Ultimate##0 ~p := #in~p;~q := #in~q; 285827#L20 assume !(~p <= 0); 285825#L21 assume !(~q <= 0); 285821#L22 assume !(~q > ~p); 285822#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287128#$Ultimate##0 ~p := #in~p;~q := #in~q; 287941#L20 assume !(~p <= 0); 287939#L21 assume !(~q <= 0); 287940#L22 assume !(~q > ~p); 287933#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287986#$Ultimate##0 ~p := #in~p;~q := #in~q; 288049#L20 assume ~p <= 0;#res := 1; 288048#partsFINAL assume true; 287932#partsEXIT >#67#return; 287923#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287931#$Ultimate##0 ~p := #in~p;~q := #in~q; 287987#L20 assume !(~p <= 0); 287988#L21 assume !(~q <= 0); 287980#L22 assume !(~q > ~p); 287978#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287979#$Ultimate##0 ~p := #in~p;~q := #in~q; 288020#L20 assume ~p <= 0;#res := 1; 288019#partsFINAL assume true; 287977#partsEXIT >#67#return; 287924#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287931#$Ultimate##0 ~p := #in~p;~q := #in~q; 287987#L20 assume !(~p <= 0); 287988#L21 assume !(~q <= 0); 287980#L22 assume !(~q > ~p); 287978#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287979#$Ultimate##0 ~p := #in~p;~q := #in~q; 288020#L20 assume ~p <= 0;#res := 1; 288019#partsFINAL assume true; 287977#partsEXIT >#67#return; 287924#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287931#$Ultimate##0 ~p := #in~p;~q := #in~q; 287987#L20 assume !(~p <= 0); 287988#L21 assume !(~q <= 0); 287980#L22 assume ~q > ~p; 287142#L22-1 call #t~ret0 := parts(~p, ~p);< 287148#$Ultimate##0 ~p := #in~p;~q := #in~q; 288005#L20 assume !(~p <= 0); 288002#L21 assume !(~q <= 0); 288001#L22 assume !(~q > ~p); 287999#L23 call #t~ret1 := parts(~p - ~q, ~q);< 288000#$Ultimate##0 ~p := #in~p;~q := #in~q; 288007#L20 assume ~p <= 0;#res := 1; 288004#partsFINAL assume true; 287998#partsEXIT >#67#return; 287899#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287908#$Ultimate##0 ~p := #in~p;~q := #in~q; 287907#L20 assume !(~p <= 0); 287906#L21 assume !(~q <= 0); 287904#L22 assume !(~q > ~p); 287905#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287943#$Ultimate##0 ~p := #in~p;~q := #in~q; 287945#L20 assume ~p <= 0;#res := 1; 287944#partsFINAL assume true; 287942#partsEXIT >#67#return; 287903#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287908#$Ultimate##0 ~p := #in~p;~q := #in~q; 287907#L20 assume !(~p <= 0); 287906#L21 assume !(~q <= 0); 287904#L22 assume !(~q > ~p); 287316#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287898#$Ultimate##0 ~p := #in~p;~q := #in~q; 287897#L20 assume !(~p <= 0); 287896#L21 assume !(~q <= 0); 287886#L22 assume !(~q > ~p); 287314#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287300#$Ultimate##0 ~p := #in~p;~q := #in~q; 288038#L20 assume ~p <= 0;#res := 1; 288037#partsFINAL assume true; 288026#partsEXIT >#67#return; 285457#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 288124#$Ultimate##0 ~p := #in~p;~q := #in~q; 288140#L20 assume !(~p <= 0); 288139#L21 assume !(~q <= 0); 288138#L22 assume !(~q > ~p); 285439#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285438#$Ultimate##0 ~p := #in~p;~q := #in~q; 285441#L20 assume ~p <= 0;#res := 1; 288110#partsFINAL assume true; 288109#partsEXIT >#67#return; 288062#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 288071#$Ultimate##0 ~p := #in~p;~q := #in~q; 288061#L20 assume !(~p <= 0); 288066#L21 assume ~q <= 0;#res := 0; 288082#partsFINAL assume true; 288074#partsEXIT >#69#return; 285378#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 288149#partsFINAL assume true; 287270#partsEXIT >#69#return; 287269#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287976#partsFINAL assume true; 287947#partsEXIT >#67#return; 287359#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287272#$Ultimate##0 ~p := #in~p;~q := #in~q; 287950#L20 assume !(~p <= 0); 287949#L21 assume ~q <= 0;#res := 0; 287358#partsFINAL assume true; 287360#partsEXIT >#69#return; 287928#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287938#partsFINAL assume true; 287930#partsEXIT >#69#return; 287928#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287938#partsFINAL assume true; 287930#partsEXIT >#69#return; 287929#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 288050#partsFINAL assume true; 287131#partsEXIT >#65#return; 287147#L22-2 #res := #t~ret0;havoc #t~ret0; 287997#partsFINAL assume true; 287917#partsEXIT >#69#return; 287928#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287938#partsFINAL assume true; 287930#partsEXIT >#69#return; 287928#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287938#partsFINAL assume true; 287930#partsEXIT >#69#return; 287262#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287230#partsFINAL assume true; 287080#partsEXIT >#67#return; 287034#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287048#$Ultimate##0 ~p := #in~p;~q := #in~q; 287779#L20 assume !(~p <= 0); 287778#L21 assume ~q <= 0;#res := 0; 287715#partsFINAL assume true; 287033#partsEXIT >#69#return; 287031#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287028#partsFINAL assume true; 287029#partsEXIT >#69#return; 285571#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285565#partsFINAL assume true; 285542#partsEXIT >#65#return; 285562#L22-2 #res := #t~ret0;havoc #t~ret0; 285998#partsFINAL assume true; 285995#partsEXIT >#71#return; 285512#L36-1 [2024-10-12 00:14:34,192 INFO L747 eck$LassoCheckResult]: Loop: 285512#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285469#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 285426#L35-3 havoc main_~q~0#1; 285427#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285630#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285510#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285511#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285626#$Ultimate##0 ~p := #in~p;~q := #in~q; 285637#L20 assume !(~p <= 0); 285636#L21 assume ~q <= 0;#res := 0; 285515#partsFINAL assume true; 285516#partsEXIT >#71#return; 285474#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285475#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285964#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285985#$Ultimate##0 ~p := #in~p;~q := #in~q; 286099#L20 assume !(~p <= 0); 286098#L21 assume !(~q <= 0); 286097#L22 assume !(~q > ~p); 286093#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286094#$Ultimate##0 ~p := #in~p;~q := #in~q; 286285#L20 assume !(~p <= 0); 286284#L21 assume !(~q <= 0); 286283#L22 assume !(~q > ~p); 286275#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286289#$Ultimate##0 ~p := #in~p;~q := #in~q; 286288#L20 assume !(~p <= 0); 286287#L21 assume !(~q <= 0); 286286#L22 assume !(~q > ~p); 286274#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286289#$Ultimate##0 ~p := #in~p;~q := #in~q; 286288#L20 assume !(~p <= 0); 286287#L21 assume !(~q <= 0); 286286#L22 assume !(~q > ~p); 286280#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286282#$Ultimate##0 ~p := #in~p;~q := #in~q; 286292#L20 assume ~p <= 0;#res := 1; 286291#partsFINAL assume true; 286279#partsEXIT >#67#return; 286270#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286272#$Ultimate##0 ~p := #in~p;~q := #in~q; 286277#L20 assume !(~p <= 0); 286276#L21 assume ~q <= 0;#res := 0; 286273#partsFINAL assume true; 286268#partsEXIT >#69#return; 286271#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286293#partsFINAL assume true; 286290#partsEXIT >#67#return; 286270#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286272#$Ultimate##0 ~p := #in~p;~q := #in~q; 286277#L20 assume !(~p <= 0); 286276#L21 assume ~q <= 0;#res := 0; 286273#partsFINAL assume true; 286268#partsEXIT >#69#return; 286271#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286293#partsFINAL assume true; 286290#partsEXIT >#67#return; 286269#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286272#$Ultimate##0 ~p := #in~p;~q := #in~q; 286277#L20 assume !(~p <= 0); 286276#L21 assume ~q <= 0;#res := 0; 286273#partsFINAL assume true; 286268#partsEXIT >#69#return; 286266#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286262#partsFINAL assume true; 286092#partsEXIT >#67#return; 286084#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286085#$Ultimate##0 ~p := #in~p;~q := #in~q; 286102#L20 assume !(~p <= 0); 286101#L21 assume ~q <= 0;#res := 0; 286090#partsFINAL assume true; 286083#partsEXIT >#69#return; 286041#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286040#partsFINAL assume true; 285983#partsEXIT >#71#return; 285978#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285979#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285396#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285397#$Ultimate##0 ~p := #in~p;~q := #in~q; 286062#L20 assume !(~p <= 0); 286061#L21 assume !(~q <= 0); 286059#L22 assume !(~q > ~p); 286060#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286437#$Ultimate##0 ~p := #in~p;~q := #in~q; 286738#L20 assume ~p <= 0;#res := 1; 286737#partsFINAL assume true; 286436#partsEXIT >#67#return; 286035#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286543#$Ultimate##0 ~p := #in~p;~q := #in~q; 286544#L20 assume !(~p <= 0); 286517#L21 assume !(~q <= 0); 286518#L22 assume !(~q > ~p); 286416#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286422#$Ultimate##0 ~p := #in~p;~q := #in~q; 288154#L20 assume !(~p <= 0); 288155#L21 assume !(~q <= 0); 288522#L22 assume !(~q > ~p); 288491#L23 call #t~ret1 := parts(~p - ~q, ~q);< 288494#$Ultimate##0 ~p := #in~p;~q := #in~q; 288566#L20 assume ~p <= 0;#res := 1; 288554#partsFINAL assume true; 288538#partsEXIT >#67#return; 286609#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286610#$Ultimate##0 ~p := #in~p;~q := #in~q; 288578#L20 assume !(~p <= 0); 288577#L21 assume ~q <= 0;#res := 0; 288575#partsFINAL assume true; 288570#partsEXIT >#69#return; 286597#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286594#partsFINAL assume true; 286415#partsEXIT >#67#return; 286400#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286404#$Ultimate##0 ~p := #in~p;~q := #in~q; 286426#L20 assume !(~p <= 0); 286425#L21 assume ~q <= 0;#res := 0; 286407#partsFINAL assume true; 286398#partsEXIT >#69#return; 286049#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286622#partsFINAL assume true; 286396#partsEXIT >#69#return; 286306#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286295#partsFINAL assume true; 285992#partsEXIT >#71#return; 285989#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285987#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285521#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285398#$Ultimate##0 ~p := #in~p;~q := #in~q; 286025#L20 assume !(~p <= 0); 286022#L21 assume !(~q <= 0); 286005#L22 assume ~q > ~p; 285551#L22-1 call #t~ret0 := parts(~p, ~p);< 285564#$Ultimate##0 ~p := #in~p;~q := #in~q; 285661#L20 assume !(~p <= 0); 285662#L21 assume !(~q <= 0); 285646#L22 assume !(~q > ~p); 285647#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285970#$Ultimate##0 ~p := #in~p;~q := #in~q; 285974#L20 assume ~p <= 0;#res := 1; 285973#partsFINAL assume true; 285965#partsEXIT >#67#return; 285575#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285835#$Ultimate##0 ~p := #in~p;~q := #in~q; 287357#L20 assume !(~p <= 0); 287356#L21 assume !(~q <= 0); 287355#L22 assume ~q > ~p; 287180#L22-1 call #t~ret0 := parts(~p, ~p);< 287228#$Ultimate##0 ~p := #in~p;~q := #in~q; 287260#L20 assume !(~p <= 0); 287256#L21 assume !(~q <= 0); 287251#L22 assume !(~q > ~p); 287252#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287277#$Ultimate##0 ~p := #in~p;~q := #in~q; 287281#L20 assume ~p <= 0;#res := 1; 287279#partsFINAL assume true; 287276#partsEXIT >#67#return; 287244#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287245#$Ultimate##0 ~p := #in~p;~q := #in~q; 287351#L20 assume !(~p <= 0); 287350#L21 assume !(~q <= 0); 287344#L22 assume ~q > ~p; 287182#L22-1 call #t~ret0 := parts(~p, ~p);< 287228#$Ultimate##0 ~p := #in~p;~q := #in~q; 287261#L20 assume !(~p <= 0); 287259#L21 assume !(~q <= 0); 287255#L22 assume !(~q > ~p); 287248#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287249#$Ultimate##0 ~p := #in~p;~q := #in~q; 287280#L20 assume ~p <= 0;#res := 1; 287278#partsFINAL assume true; 287275#partsEXIT >#67#return; 287171#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287327#$Ultimate##0 ~p := #in~p;~q := #in~q; 287343#L20 assume !(~p <= 0); 287342#L21 assume !(~q <= 0); 287341#L22 assume !(~q > ~p); 287304#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287306#$Ultimate##0 ~p := #in~p;~q := #in~q; 287308#L20 assume ~p <= 0;#res := 1; 287307#partsFINAL assume true; 287303#partsEXIT >#67#return; 287239#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 287243#$Ultimate##0 ~p := #in~p;~q := #in~q; 287257#L20 assume !(~p <= 0); 287253#L21 assume ~q <= 0;#res := 0; 287246#partsFINAL assume true; 287238#partsEXIT >#69#return; 287164#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287333#partsFINAL assume true; 287166#partsEXIT >#69#return; 287174#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287227#partsFINAL assume true; 287177#partsEXIT >#65#return; 287185#L22-2 #res := #t~ret0;havoc #t~ret0; 287334#partsFINAL assume true; 287328#partsEXIT >#69#return; 287174#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287227#partsFINAL assume true; 287177#partsEXIT >#65#return; 287184#L22-2 #res := #t~ret0;havoc #t~ret0; 287335#partsFINAL assume true; 285574#partsEXIT >#69#return; 285571#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285565#partsFINAL assume true; 285542#partsEXIT >#65#return; 285563#L22-2 #res := #t~ret0;havoc #t~ret0; 286000#partsFINAL assume true; 285520#partsEXIT >#71#return; 285512#L36-1 [2024-10-12 00:14:34,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 124852941, now seen corresponding path program 4 times [2024-10-12 00:14:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:34,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000028835] [2024-10-12 00:14:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 00:14:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 00:14:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 00:14:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 540 proven. 251 refuted. 0 times theorem prover too weak. 1394 trivial. 0 not checked. [2024-10-12 00:14:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000028835] [2024-10-12 00:14:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000028835] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778930356] [2024-10-12 00:14:35,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:35,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:35,044 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:35,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2024-10-12 00:14:35,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:35,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:35,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:35,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 230 proven. 188 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2024-10-12 00:14:35,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 230 proven. 190 refuted. 0 times theorem prover too weak. 1765 trivial. 0 not checked. [2024-10-12 00:14:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778930356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:35,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 20 [2024-10-12 00:14:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682400173] [2024-10-12 00:14:35,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:35,747 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:35,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1449913512, now seen corresponding path program 2 times [2024-10-12 00:14:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:35,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786252853] [2024-10-12 00:14:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 00:14:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 00:14:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 00:14:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 146 proven. 483 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-10-12 00:14:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786252853] [2024-10-12 00:14:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786252853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910056748] [2024-10-12 00:14:36,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:36,252 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:36,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2024-10-12 00:14:36,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:36,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:36,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 00:14:36,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 1197 proven. 249 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2024-10-12 00:14:36,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 136 proven. 615 refuted. 0 times theorem prover too weak. 1388 trivial. 0 not checked. [2024-10-12 00:14:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910056748] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:37,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 35 [2024-10-12 00:14:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118412631] [2024-10-12 00:14:37,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:37,281 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 00:14:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 00:14:37,282 INFO L87 Difference]: Start difference. First operand 3499 states and 5000 transitions. cyclomatic complexity: 1581 Second operand has 35 states, 32 states have (on average 2.90625) internal successors, (93), 30 states have internal predecessors, (93), 24 states have call successors, (32), 2 states have call predecessors, (32), 8 states have return successors, (37), 15 states have call predecessors, (37), 24 states have call successors, (37) [2024-10-12 00:14:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:38,346 INFO L93 Difference]: Finished difference Result 5431 states and 9631 transitions. [2024-10-12 00:14:38,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5431 states and 9631 transitions. [2024-10-12 00:14:38,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2024-10-12 00:14:38,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5431 states to 5211 states and 8589 transitions. [2024-10-12 00:14:38,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 736 [2024-10-12 00:14:38,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 776 [2024-10-12 00:14:38,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5211 states and 8589 transitions. [2024-10-12 00:14:38,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:38,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5211 states and 8589 transitions. [2024-10-12 00:14:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states and 8589 transitions. [2024-10-12 00:14:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 4311. [2024-10-12 00:14:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 2645 states have (on average 1.1833648393194707) internal successors, (3130), 2971 states have internal predecessors, (3130), 1139 states have call successors, (1188), 509 states have call predecessors, (1188), 527 states have return successors, (1951), 830 states have call predecessors, (1951), 1119 states have call successors, (1951) [2024-10-12 00:14:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 6269 transitions. [2024-10-12 00:14:38,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4311 states and 6269 transitions. [2024-10-12 00:14:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-12 00:14:38,533 INFO L425 stractBuchiCegarLoop]: Abstraction has 4311 states and 6269 transitions. [2024-10-12 00:14:38,533 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-12 00:14:38,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4311 states and 6269 transitions. [2024-10-12 00:14:38,544 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-10-12 00:14:38,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:38,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:38,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:38,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [37, 37, 27, 19, 14, 14, 14, 14, 14, 14, 10, 8, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-12 00:14:38,547 INFO L745 eck$LassoCheckResult]: Stem: 298807#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 298762#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; 298763#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; 298755#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; 298756#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 298863#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298860#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298861#$Ultimate##0 ~p := #in~p;~q := #in~q; 298864#L20 assume ~p <= 0;#res := 1; 298862#partsFINAL assume true; 298859#partsEXIT >#71#return; 298857#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298854#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298849#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298851#$Ultimate##0 ~p := #in~p;~q := #in~q; 298855#L20 assume ~p <= 0;#res := 1; 298852#partsFINAL assume true; 298848#partsEXIT >#71#return; 298845#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298842#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298837#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298839#$Ultimate##0 ~p := #in~p;~q := #in~q; 298841#L20 assume ~p <= 0;#res := 1; 298840#partsFINAL assume true; 298836#partsEXIT >#71#return; 298835#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298834#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 298786#L35-3 havoc main_~q~0#1; 298779#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 298780#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 298833#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298986#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298987#$Ultimate##0 ~p := #in~p;~q := #in~q; 298990#L20 assume !(~p <= 0); 298989#L21 assume ~q <= 0;#res := 0; 298988#partsFINAL assume true; 298985#partsEXIT >#71#return; 298980#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298978#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298968#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298973#$Ultimate##0 ~p := #in~p;~q := #in~q; 299205#L20 assume !(~p <= 0); 299203#L21 assume !(~q <= 0); 299202#L22 assume !(~q > ~p); 299200#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299201#$Ultimate##0 ~p := #in~p;~q := #in~q; 299206#L20 assume ~p <= 0;#res := 1; 299204#partsFINAL assume true; 299199#partsEXIT >#67#return; 299197#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299198#$Ultimate##0 ~p := #in~p;~q := #in~q; 299217#L20 assume !(~p <= 0); 299208#L21 assume ~q <= 0;#res := 0; 299207#partsFINAL assume true; 299196#partsEXIT >#69#return; 299195#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299179#partsFINAL assume true; 298967#partsEXIT >#71#return; 298969#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298981#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298888#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298890#$Ultimate##0 ~p := #in~p;~q := #in~q; 299460#L20 assume !(~p <= 0); 299461#L21 assume !(~q <= 0); 299456#L22 assume ~q > ~p; 299457#L22-1 call #t~ret0 := parts(~p, ~p);< 301313#$Ultimate##0 ~p := #in~p;~q := #in~q; 301312#L20 assume !(~p <= 0); 301317#L21 assume !(~q <= 0); 301314#L22 assume !(~q > ~p); 301315#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301711#$Ultimate##0 ~p := #in~p;~q := #in~q; 301727#L20 assume ~p <= 0;#res := 1; 301713#partsFINAL assume true; 301707#partsEXIT >#67#return; 301672#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301759#$Ultimate##0 ~p := #in~p;~q := #in~q; 301758#L20 assume !(~p <= 0); 301757#L21 assume !(~q <= 0); 301755#L22 assume ~q > ~p; 301749#L22-1 call #t~ret0 := parts(~p, ~p);< 301754#$Ultimate##0 ~p := #in~p;~q := #in~q; 301820#L20 assume !(~p <= 0); 301818#L21 assume !(~q <= 0); 301815#L22 assume !(~q > ~p); 301802#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301806#$Ultimate##0 ~p := #in~p;~q := #in~q; 301858#L20 assume ~p <= 0;#res := 1; 301850#partsFINAL assume true; 301848#partsEXIT >#67#return; 301769#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301821#$Ultimate##0 ~p := #in~p;~q := #in~q; 301819#L20 assume !(~p <= 0); 301817#L21 assume !(~q <= 0); 301813#L22 assume !(~q > ~p); 301780#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301784#$Ultimate##0 ~p := #in~p;~q := #in~q; 301794#L20 assume ~p <= 0;#res := 1; 301789#partsFINAL assume true; 301777#partsEXIT >#67#return; 301762#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301773#$Ultimate##0 ~p := #in~p;~q := #in~q; 301793#L20 assume !(~p <= 0); 301788#L21 assume ~q <= 0;#res := 0; 301776#partsFINAL assume true; 301761#partsEXIT >#69#return; 301765#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301880#partsFINAL assume true; 301768#partsEXIT >#69#return; 301766#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301787#partsFINAL assume true; 301748#partsEXIT >#65#return; 301746#L22-2 #res := #t~ret0;havoc #t~ret0; 301747#partsFINAL assume true; 301671#partsEXIT >#69#return; 301668#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301052#partsFINAL assume true; 301055#partsEXIT >#65#return; 301363#L22-2 #res := #t~ret0;havoc #t~ret0; 299447#partsFINAL assume true; 299448#partsEXIT >#71#return; 298882#L36-1 [2024-10-12 00:14:38,547 INFO L747 eck$LassoCheckResult]: Loop: 298882#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298843#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 298844#L35-3 havoc main_~q~0#1; 298777#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 298778#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 298879#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298868#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298869#$Ultimate##0 ~p := #in~p;~q := #in~q; 298885#L20 assume !(~p <= 0); 298884#L21 assume ~q <= 0;#res := 0; 298883#partsFINAL assume true; 298867#partsEXIT >#71#return; 298827#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298828#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298753#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 299378#$Ultimate##0 ~p := #in~p;~q := #in~q; 299392#L20 assume !(~p <= 0); 299391#L21 assume !(~q <= 0); 299389#L22 assume !(~q > ~p); 299386#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299387#$Ultimate##0 ~p := #in~p;~q := #in~q; 299414#L20 assume !(~p <= 0); 299413#L21 assume !(~q <= 0); 299411#L22 assume !(~q > ~p); 299412#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299442#$Ultimate##0 ~p := #in~p;~q := #in~q; 299446#L20 assume ~p <= 0;#res := 1; 299444#partsFINAL assume true; 299441#partsEXIT >#67#return; 299436#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299439#$Ultimate##0 ~p := #in~p;~q := #in~q; 299445#L20 assume !(~p <= 0); 299443#L21 assume ~q <= 0;#res := 0; 299440#partsFINAL assume true; 299435#partsEXIT >#69#return; 299438#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 302836#partsFINAL assume true; 303041#partsEXIT >#67#return; 298793#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302851#$Ultimate##0 ~p := #in~p;~q := #in~q; 302850#L20 assume !(~p <= 0); 298792#L21 assume ~q <= 0;#res := 0; 298794#partsFINAL assume true; 303029#partsEXIT >#69#return; 303040#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 303039#partsFINAL assume true; 303025#partsEXIT >#71#return; 303026#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 303032#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298801#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298975#$Ultimate##0 ~p := #in~p;~q := #in~q; 299131#L20 assume !(~p <= 0); 299130#L21 assume !(~q <= 0); 299127#L22 assume !(~q > ~p); 299128#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299611#$Ultimate##0 ~p := #in~p;~q := #in~q; 299626#L20 assume !(~p <= 0); 299625#L21 assume !(~q <= 0); 299622#L22 assume ~q > ~p; 299617#L22-1 call #t~ret0 := parts(~p, ~p);< 299620#$Ultimate##0 ~p := #in~p;~q := #in~q; 299881#L20 assume !(~p <= 0); 299880#L21 assume !(~q <= 0); 299878#L22 assume !(~q > ~p); 299879#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299894#$Ultimate##0 ~p := #in~p;~q := #in~q; 299905#L20 assume ~p <= 0;#res := 1; 299902#partsFINAL assume true; 299893#partsEXIT >#67#return; 299802#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299886#$Ultimate##0 ~p := #in~p;~q := #in~q; 299948#L20 assume !(~p <= 0); 299946#L21 assume !(~q <= 0); 299943#L22 assume ~q > ~p; 299932#L22-1 call #t~ret0 := parts(~p, ~p);< 299982#$Ultimate##0 ~p := #in~p;~q := #in~q; 299980#L20 assume !(~p <= 0); 299977#L21 assume !(~q <= 0); 299972#L22 assume !(~q > ~p); 299952#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299953#$Ultimate##0 ~p := #in~p;~q := #in~q; 299976#L20 assume ~p <= 0;#res := 1; 299971#partsFINAL assume true; 299951#partsEXIT >#67#return; 299923#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299916#$Ultimate##0 ~p := #in~p;~q := #in~q; 299949#L20 assume !(~p <= 0); 299947#L21 assume !(~q <= 0); 299945#L22 assume ~q > ~p; 299931#L22-1 call #t~ret0 := parts(~p, ~p);< 299982#$Ultimate##0 ~p := #in~p;~q := #in~q; 299981#L20 assume !(~p <= 0); 299979#L21 assume !(~q <= 0); 299975#L22 assume !(~q > ~p); 299969#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299970#$Ultimate##0 ~p := #in~p;~q := #in~q; 299978#L20 assume ~p <= 0;#res := 1; 299974#partsFINAL assume true; 299968#partsEXIT >#67#return; 299909#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299920#$Ultimate##0 ~p := #in~p;~q := #in~q; 299963#L20 assume !(~p <= 0); 299964#L21 assume ~q <= 0;#res := 0; 299928#partsFINAL assume true; 299929#partsEXIT >#69#return; 299913#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299996#partsFINAL assume true; 299990#partsEXIT >#65#return; 299989#L22-2 #res := #t~ret0;havoc #t~ret0; 299986#partsFINAL assume true; 299921#partsEXIT >#69#return; 299913#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299996#partsFINAL assume true; 299990#partsEXIT >#65#return; 299992#L22-2 #res := #t~ret0;havoc #t~ret0; 299999#partsFINAL assume true; 299801#partsEXIT >#69#return; 299804#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299877#partsFINAL assume true; 299616#partsEXIT >#65#return; 299614#L22-2 #res := #t~ret0;havoc #t~ret0; 299613#partsFINAL assume true; 299609#partsEXIT >#67#return; 299102#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299467#$Ultimate##0 ~p := #in~p;~q := #in~q; 299482#L20 assume !(~p <= 0); 299481#L21 assume !(~q <= 0); 299477#L22 assume !(~q > ~p); 299480#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299504#$Ultimate##0 ~p := #in~p;~q := #in~q; 300087#L20 assume !(~p <= 0); 300085#L21 assume !(~q <= 0); 300083#L22 assume !(~q > ~p); 300063#L23 call #t~ret1 := parts(~p - ~q, ~q);< 300064#$Ultimate##0 ~p := #in~p;~q := #in~q; 300082#L20 assume ~p <= 0;#res := 1; 300081#partsFINAL assume true; 300062#partsEXIT >#67#return; 299700#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 300060#$Ultimate##0 ~p := #in~p;~q := #in~q; 300058#L20 assume !(~p <= 0); 300056#L21 assume !(~q <= 0); 300054#L22 assume !(~q > ~p); 300047#L23 call #t~ret1 := parts(~p - ~q, ~q);< 300049#$Ultimate##0 ~p := #in~p;~q := #in~q; 300053#L20 assume ~p <= 0;#res := 1; 300052#partsFINAL assume true; 300046#partsEXIT >#67#return; 299543#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 300044#$Ultimate##0 ~p := #in~p;~q := #in~q; 300055#L20 assume !(~p <= 0); 300050#L21 assume ~q <= 0;#res := 0; 300045#partsFINAL assume true; 300043#partsEXIT >#69#return; 299523#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 300039#partsFINAL assume true; 300080#partsEXIT >#69#return; 299695#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299687#partsFINAL assume true; 299681#partsEXIT >#67#return; 299497#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299551#$Ultimate##0 ~p := #in~p;~q := #in~q; 299703#L20 assume !(~p <= 0); 299696#L21 assume !(~q <= 0); 299689#L22 assume !(~q > ~p); 299553#L23 call #t~ret1 := parts(~p - ~q, ~q);< 299569#$Ultimate##0 ~p := #in~p;~q := #in~q; 299603#L20 assume !(~p <= 0); 299593#L21 assume !(~q <= 0); 299595#L22 assume !(~q > ~p); 300403#L23 call #t~ret1 := parts(~p - ~q, ~q);< 300405#$Ultimate##0 ~p := #in~p;~q := #in~q; 300420#L20 assume ~p <= 0;#res := 1; 300415#partsFINAL assume true; 300407#partsEXIT >#67#return; 299705#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 300382#$Ultimate##0 ~p := #in~p;~q := #in~q; 300450#L20 assume !(~p <= 0); 300449#L21 assume ~q <= 0;#res := 0; 300448#partsFINAL assume true; 299704#partsEXIT >#69#return; 299697#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299692#partsFINAL assume true; 299684#partsEXIT >#67#return; 299559#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 299679#$Ultimate##0 ~p := #in~p;~q := #in~q; 299691#L20 assume !(~p <= 0); 299683#L21 assume ~q <= 0;#res := 0; 299680#partsFINAL assume true; 299675#partsEXIT >#69#return; 299677#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299548#partsFINAL assume true; 299550#partsEXIT >#69#return; 299677#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 299548#partsFINAL assume true; 299550#partsEXIT >#69#return; 299489#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 303045#partsFINAL assume true; 303038#partsEXIT >#71#return; 298952#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 298953#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 298803#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 298974#$Ultimate##0 ~p := #in~p;~q := #in~q; 299078#L20 assume !(~p <= 0); 299077#L21 assume !(~q <= 0); 299074#L22 assume ~q > ~p; 299062#L22-1 call #t~ret0 := parts(~p, ~p);< 299073#$Ultimate##0 ~p := #in~p;~q := #in~q; 301416#L20 assume !(~p <= 0); 301419#L21 assume !(~q <= 0); 301417#L22 assume !(~q > ~p); 301418#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301712#$Ultimate##0 ~p := #in~p;~q := #in~q; 301728#L20 assume ~p <= 0;#res := 1; 301714#partsFINAL assume true; 301708#partsEXIT >#67#return; 301672#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301759#$Ultimate##0 ~p := #in~p;~q := #in~q; 301758#L20 assume !(~p <= 0); 301757#L21 assume !(~q <= 0); 301755#L22 assume ~q > ~p; 301749#L22-1 call #t~ret0 := parts(~p, ~p);< 301754#$Ultimate##0 ~p := #in~p;~q := #in~q; 301820#L20 assume !(~p <= 0); 301818#L21 assume !(~q <= 0); 301815#L22 assume !(~q > ~p); 301802#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301806#$Ultimate##0 ~p := #in~p;~q := #in~q; 301858#L20 assume ~p <= 0;#res := 1; 301850#partsFINAL assume true; 301848#partsEXIT >#67#return; 301769#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301821#$Ultimate##0 ~p := #in~p;~q := #in~q; 301819#L20 assume !(~p <= 0); 301817#L21 assume !(~q <= 0); 301813#L22 assume !(~q > ~p); 301780#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301784#$Ultimate##0 ~p := #in~p;~q := #in~q; 301794#L20 assume ~p <= 0;#res := 1; 301789#partsFINAL assume true; 301777#partsEXIT >#67#return; 301762#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301773#$Ultimate##0 ~p := #in~p;~q := #in~q; 301793#L20 assume !(~p <= 0); 301788#L21 assume ~q <= 0;#res := 0; 301776#partsFINAL assume true; 301761#partsEXIT >#69#return; 301765#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301880#partsFINAL assume true; 301768#partsEXIT >#69#return; 301766#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301787#partsFINAL assume true; 301748#partsEXIT >#65#return; 301746#L22-2 #res := #t~ret0;havoc #t~ret0; 301747#partsFINAL assume true; 301671#partsEXIT >#69#return; 301668#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301052#partsFINAL assume true; 301055#partsEXIT >#65#return; 299037#L22-2 #res := #t~ret0;havoc #t~ret0; 299033#partsFINAL assume true; 298982#partsEXIT >#71#return; 298882#L36-1 [2024-10-12 00:14:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash -28325467, now seen corresponding path program 5 times [2024-10-12 00:14:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299899519] [2024-10-12 00:14:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 00:14:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 185 proven. 38 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-10-12 00:14:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299899519] [2024-10-12 00:14:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299899519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935094227] [2024-10-12 00:14:38,832 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:38,833 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:38,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2024-10-12 00:14:38,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-12 00:14:38,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:38,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:38,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 107 proven. 14 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-10-12 00:14:38,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 107 proven. 14 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-10-12 00:14:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935094227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:39,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2024-10-12 00:14:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089553063] [2024-10-12 00:14:39,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:39,081 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1432044822, now seen corresponding path program 3 times [2024-10-12 00:14:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044238446] [2024-10-12 00:14:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 00:14:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 00:14:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 00:14:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-12 00:14:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3501 backedges. 608 proven. 326 refuted. 0 times theorem prover too weak. 2567 trivial. 0 not checked. [2024-10-12 00:14:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044238446] [2024-10-12 00:14:39,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044238446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146726657] [2024-10-12 00:14:39,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:39,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:39,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:39,468 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:39,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2024-10-12 00:14:39,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-12 00:14:39,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:39,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:39,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3501 backedges. 586 proven. 10 refuted. 0 times theorem prover too weak. 2905 trivial. 0 not checked. [2024-10-12 00:14:39,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3501 backedges. 586 proven. 10 refuted. 0 times theorem prover too weak. 2905 trivial. 0 not checked. [2024-10-12 00:14:40,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146726657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:40,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:40,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 23 [2024-10-12 00:14:40,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727714461] [2024-10-12 00:14:40,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:40,076 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:40,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:40,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:14:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:14:40,077 INFO L87 Difference]: Start difference. First operand 4311 states and 6269 transitions. cyclomatic complexity: 2065 Second operand has 14 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 8 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (17), 9 states have call predecessors, (17), 8 states have call successors, (17) [2024-10-12 00:14:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:40,238 INFO L93 Difference]: Finished difference Result 3893 states and 4924 transitions. [2024-10-12 00:14:40,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3893 states and 4924 transitions. [2024-10-12 00:14:40,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 80 [2024-10-12 00:14:40,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3893 states to 1535 states and 1988 transitions. [2024-10-12 00:14:40,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 344 [2024-10-12 00:14:40,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 351 [2024-10-12 00:14:40,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1535 states and 1988 transitions. [2024-10-12 00:14:40,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:40,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1535 states and 1988 transitions. [2024-10-12 00:14:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states and 1988 transitions. [2024-10-12 00:14:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1374. [2024-10-12 00:14:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 907 states have (on average 1.1300992282249174) internal successors, (1025), 974 states have internal predecessors, (1025), 296 states have call successors, (310), 174 states have call predecessors, (310), 171 states have return successors, (410), 225 states have call predecessors, (410), 272 states have call successors, (410) [2024-10-12 00:14:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1745 transitions. [2024-10-12 00:14:40,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1374 states and 1745 transitions. [2024-10-12 00:14:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:14:40,271 INFO L425 stractBuchiCegarLoop]: Abstraction has 1374 states and 1745 transitions. [2024-10-12 00:14:40,271 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-12 00:14:40,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1374 states and 1745 transitions. [2024-10-12 00:14:40,274 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-10-12 00:14:40,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:40,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:40,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:40,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 23, 14, 10, 10, 10, 10, 10, 10, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-12 00:14:40,275 INFO L745 eck$LassoCheckResult]: Stem: 310518#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 310485#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; 310486#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; 310478#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; 310479#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 310566#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310563#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310564#$Ultimate##0 ~p := #in~p;~q := #in~q; 310567#L20 assume ~p <= 0;#res := 1; 310565#partsFINAL assume true; 310562#partsEXIT >#71#return; 310560#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310557#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310552#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310554#$Ultimate##0 ~p := #in~p;~q := #in~q; 310558#L20 assume ~p <= 0;#res := 1; 310555#partsFINAL assume true; 310551#partsEXIT >#71#return; 310550#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310548#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310544#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310545#$Ultimate##0 ~p := #in~p;~q := #in~q; 310549#L20 assume ~p <= 0;#res := 1; 310547#partsFINAL assume true; 310543#partsEXIT >#71#return; 310542#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310541#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 310499#L35-3 havoc main_~q~0#1; 310492#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 310493#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 310540#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310705#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310706#$Ultimate##0 ~p := #in~p;~q := #in~q; 310717#L20 assume !(~p <= 0); 310715#L21 assume ~q <= 0;#res := 0; 310713#partsFINAL assume true; 310704#partsEXIT >#71#return; 310700#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310698#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310690#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310696#$Ultimate##0 ~p := #in~p;~q := #in~q; 310718#L20 assume !(~p <= 0); 310716#L21 assume !(~q <= 0); 310714#L22 assume !(~q > ~p); 310711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310712#$Ultimate##0 ~p := #in~p;~q := #in~q; 310720#L20 assume ~p <= 0;#res := 1; 310719#partsFINAL assume true; 310710#partsEXIT >#67#return; 310702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310703#$Ultimate##0 ~p := #in~p;~q := #in~q; 310709#L20 assume !(~p <= 0); 310708#L21 assume ~q <= 0;#res := 0; 310707#partsFINAL assume true; 310701#partsEXIT >#69#return; 310699#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 310697#partsFINAL assume true; 310689#partsEXIT >#71#return; 310691#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310721#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310685#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311523#$Ultimate##0 ~p := #in~p;~q := #in~q; 311522#L20 assume !(~p <= 0); 310740#L21 assume !(~q <= 0); 310741#L22 assume ~q > ~p; 310735#L22-1 call #t~ret0 := parts(~p, ~p);< 310736#$Ultimate##0 ~p := #in~p;~q := #in~q; 311520#L20 assume !(~p <= 0); 311389#L21 assume !(~q <= 0); 311387#L22 assume !(~q > ~p); 311388#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311410#$Ultimate##0 ~p := #in~p;~q := #in~q; 311430#L20 assume ~p <= 0;#res := 1; 311431#partsFINAL assume true; 311407#partsEXIT >#67#return; 311402#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311440#$Ultimate##0 ~p := #in~p;~q := #in~q; 311441#L20 assume !(~p <= 0); 311436#L21 assume !(~q <= 0); 311437#L22 assume !(~q > ~p); 311434#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311526#$Ultimate##0 ~p := #in~p;~q := #in~q; 311646#L20 assume !(~p <= 0); 311624#L21 assume !(~q <= 0); 311625#L22 assume ~q > ~p; 311577#L22-1 call #t~ret0 := parts(~p, ~p);< 311581#$Ultimate##0 ~p := #in~p;~q := #in~q; 311600#L20 assume !(~p <= 0); 311599#L21 assume !(~q <= 0); 311598#L22 assume !(~q > ~p); 311596#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311597#$Ultimate##0 ~p := #in~p;~q := #in~q; 311616#L20 assume ~p <= 0;#res := 1; 311601#partsFINAL assume true; 311595#partsEXIT >#67#return; 311588#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311589#$Ultimate##0 ~p := #in~p;~q := #in~q; 311594#L20 assume !(~p <= 0); 311592#L21 assume ~q <= 0;#res := 0; 311591#partsFINAL assume true; 311587#partsEXIT >#69#return; 311584#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311582#partsFINAL assume true; 311576#partsEXIT >#65#return; 311574#L22-2 #res := #t~ret0;havoc #t~ret0; 311573#partsFINAL assume true; 311558#partsEXIT >#67#return; 311470#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311474#$Ultimate##0 ~p := #in~p;~q := #in~q; 311494#L20 assume !(~p <= 0); 311482#L21 assume ~q <= 0;#res := 0; 311476#partsFINAL assume true; 311468#partsEXIT >#69#return; 311473#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311550#partsFINAL assume true; 311549#partsEXIT >#69#return; 311345#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311548#partsFINAL assume true; 311546#partsEXIT >#65#return; 311547#L22-2 #res := #t~ret0;havoc #t~ret0; 311676#partsFINAL assume true; 311675#partsEXIT >#71#return; 310569#L36-1 [2024-10-12 00:14:40,275 INFO L747 eck$LassoCheckResult]: Loop: 310569#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310568#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 310497#L35-3 havoc main_~q~0#1; 310498#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 310538#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 310539#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310575#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310579#$Ultimate##0 ~p := #in~p;~q := #in~q; 310593#L20 assume !(~p <= 0); 310589#L21 assume ~q <= 0;#res := 0; 310586#partsFINAL assume true; 310574#partsEXIT >#71#return; 310530#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310531#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310748#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310755#$Ultimate##0 ~p := #in~p;~q := #in~q; 310804#L20 assume !(~p <= 0); 310802#L21 assume !(~q <= 0); 310797#L22 assume !(~q > ~p); 310762#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310763#$Ultimate##0 ~p := #in~p;~q := #in~q; 310795#L20 assume !(~p <= 0); 310793#L21 assume !(~q <= 0); 310785#L22 assume !(~q > ~p); 310786#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310813#$Ultimate##0 ~p := #in~p;~q := #in~q; 310816#L20 assume ~p <= 0;#res := 1; 310815#partsFINAL assume true; 310812#partsEXIT >#67#return; 310806#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310809#$Ultimate##0 ~p := #in~p;~q := #in~q; 310814#L20 assume !(~p <= 0); 310811#L21 assume ~q <= 0;#res := 0; 310810#partsFINAL assume true; 310805#partsEXIT >#69#return; 310808#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311279#partsFINAL assume true; 311277#partsEXIT >#67#return; 311274#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311275#$Ultimate##0 ~p := #in~p;~q := #in~q; 311280#L20 assume !(~p <= 0); 311278#L21 assume ~q <= 0;#res := 0; 311276#partsFINAL assume true; 311273#partsEXIT >#69#return; 311272#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311271#partsFINAL assume true; 311250#partsEXIT >#71#return; 311251#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311257#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310472#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310694#$Ultimate##0 ~p := #in~p;~q := #in~q; 310858#L20 assume !(~p <= 0); 310856#L21 assume !(~q <= 0); 310835#L22 assume !(~q > ~p); 310837#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310978#$Ultimate##0 ~p := #in~p;~q := #in~q; 310997#L20 assume !(~p <= 0); 310993#L21 assume !(~q <= 0); 310990#L22 assume ~q > ~p; 310985#L22-1 call #t~ret0 := parts(~p, ~p);< 310986#$Ultimate##0 ~p := #in~p;~q := #in~q; 311008#L20 assume !(~p <= 0); 311007#L21 assume !(~q <= 0); 311004#L22 assume !(~q > ~p); 311000#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311001#$Ultimate##0 ~p := #in~p;~q := #in~q; 311006#L20 assume ~p <= 0;#res := 1; 311003#partsFINAL assume true; 310999#partsEXIT >#67#return; 310995#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310996#$Ultimate##0 ~p := #in~p;~q := #in~q; 311005#L20 assume !(~p <= 0); 311002#L21 assume ~q <= 0;#res := 0; 310998#partsFINAL assume true; 310994#partsEXIT >#69#return; 310992#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 310989#partsFINAL assume true; 310984#partsEXIT >#65#return; 310981#L22-2 #res := #t~ret0;havoc #t~ret0; 310979#partsFINAL assume true; 310976#partsEXIT >#67#return; 310908#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310923#$Ultimate##0 ~p := #in~p;~q := #in~q; 310974#L20 assume !(~p <= 0); 310973#L21 assume !(~q <= 0); 310972#L22 assume !(~q > ~p); 310928#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310930#$Ultimate##0 ~p := #in~p;~q := #in~q; 310975#L20 assume !(~p <= 0); 310954#L21 assume !(~q <= 0); 310938#L22 assume ~q > ~p; 310935#L22-1 call #t~ret0 := parts(~p, ~p);< 310936#$Ultimate##0 ~p := #in~p;~q := #in~q; 310953#L20 assume !(~p <= 0); 310952#L21 assume !(~q <= 0); 310949#L22 assume !(~q > ~p); 310945#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310946#$Ultimate##0 ~p := #in~p;~q := #in~q; 310951#L20 assume ~p <= 0;#res := 1; 310948#partsFINAL assume true; 310944#partsEXIT >#67#return; 310941#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310942#$Ultimate##0 ~p := #in~p;~q := #in~q; 310950#L20 assume !(~p <= 0); 310947#L21 assume ~q <= 0;#res := 0; 310943#partsFINAL assume true; 310940#partsEXIT >#69#return; 310939#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 310937#partsFINAL assume true; 310934#partsEXIT >#65#return; 310933#L22-2 #res := #t~ret0;havoc #t~ret0; 310931#partsFINAL assume true; 310925#partsEXIT >#67#return; 310910#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310923#$Ultimate##0 ~p := #in~p;~q := #in~q; 310974#L20 assume !(~p <= 0); 310973#L21 assume !(~q <= 0); 310972#L22 assume !(~q > ~p); 310969#L23 call #t~ret1 := parts(~p - ~q, ~q);< 310971#$Ultimate##0 ~p := #in~p;~q := #in~q; 311076#L20 assume !(~p <= 0); 311073#L21 assume !(~q <= 0); 311074#L22 assume !(~q > ~p); 311034#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311217#$Ultimate##0 ~p := #in~p;~q := #in~q; 311209#L20 assume !(~p <= 0); 311210#L21 assume !(~q <= 0); 311221#L22 assume ~q > ~p; 311027#L22-1 call #t~ret0 := parts(~p, ~p);< 311031#$Ultimate##0 ~p := #in~p;~q := #in~q; 311065#L20 assume !(~p <= 0); 311064#L21 assume !(~q <= 0); 311063#L22 assume !(~q > ~p); 311057#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311058#$Ultimate##0 ~p := #in~p;~q := #in~q; 311062#L20 assume ~p <= 0;#res := 1; 311060#partsFINAL assume true; 311056#partsEXIT >#67#return; 311053#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311054#$Ultimate##0 ~p := #in~p;~q := #in~q; 311061#L20 assume !(~p <= 0); 311059#L21 assume ~q <= 0;#res := 0; 311055#partsFINAL assume true; 311052#partsEXIT >#69#return; 311050#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311044#partsFINAL assume true; 311025#partsEXIT >#65#return; 311029#L22-2 #res := #t~ret0;havoc #t~ret0; 311215#partsFINAL assume true; 311110#partsEXIT >#67#return; 311097#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311104#$Ultimate##0 ~p := #in~p;~q := #in~q; 311113#L20 assume !(~p <= 0); 311112#L21 assume ~q <= 0;#res := 0; 311106#partsFINAL assume true; 311096#partsEXIT >#69#return; 311095#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311094#partsFINAL assume true; 311093#partsEXIT >#67#return; 310917#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 310956#$Ultimate##0 ~p := #in~p;~q := #in~q; 311010#L20 assume !(~p <= 0); 311009#L21 assume ~q <= 0;#res := 0; 310955#partsFINAL assume true; 310915#partsEXIT >#69#return; 310919#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311284#partsFINAL assume true; 310920#partsEXIT >#69#return; 310919#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311284#partsFINAL assume true; 310920#partsEXIT >#69#return; 310911#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311255#partsFINAL assume true; 311253#partsEXIT >#71#return; 310722#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 310723#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310475#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310695#$Ultimate##0 ~p := #in~p;~q := #in~q; 310746#L20 assume !(~p <= 0); 310747#L21 assume !(~q <= 0); 310739#L22 assume ~q > ~p; 310732#L22-1 call #t~ret0 := parts(~p, ~p);< 310737#$Ultimate##0 ~p := #in~p;~q := #in~q; 311372#L20 assume !(~p <= 0); 311366#L21 assume !(~q <= 0); 311367#L22 assume !(~q > ~p); 311356#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311357#$Ultimate##0 ~p := #in~p;~q := #in~q; 311524#L20 assume ~p <= 0;#res := 1; 311361#partsFINAL assume true; 311362#partsEXIT >#67#return; 311344#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311351#$Ultimate##0 ~p := #in~p;~q := #in~q; 311360#L20 assume !(~p <= 0); 311359#L21 assume ~q <= 0;#res := 0; 311353#partsFINAL assume true; 311343#partsEXIT >#69#return; 311345#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311548#partsFINAL assume true; 311546#partsEXIT >#65#return; 310682#L22-2 #res := #t~ret0;havoc #t~ret0; 310683#partsFINAL assume true; 310570#partsEXIT >#71#return; 310569#L36-1 [2024-10-12 00:14:40,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash 448370189, now seen corresponding path program 6 times [2024-10-12 00:14:40,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:40,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611006368] [2024-10-12 00:14:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 00:14:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 122 proven. 80 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-10-12 00:14:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611006368] [2024-10-12 00:14:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611006368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990172189] [2024-10-12 00:14:40,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:40,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:40,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:40,440 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:40,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2024-10-12 00:14:40,503 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-10-12 00:14:40,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:40,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:40,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 125 proven. 80 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-10-12 00:14:40,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 125 proven. 82 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-12 00:14:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990172189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:40,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:40,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2024-10-12 00:14:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757560882] [2024-10-12 00:14:40,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:40,840 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2014650377, now seen corresponding path program 4 times [2024-10-12 00:14:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943777966] [2024-10-12 00:14:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 00:14:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 00:14:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-12 00:14:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 219 proven. 185 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [2024-10-12 00:14:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943777966] [2024-10-12 00:14:41,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943777966] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203033721] [2024-10-12 00:14:41,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:41,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:41,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:41,089 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:41,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2024-10-12 00:14:41,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:41,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:41,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 00:14:41,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 602 proven. 407 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2024-10-12 00:14:41,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 101 proven. 502 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2024-10-12 00:14:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203033721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:41,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 16] total 28 [2024-10-12 00:14:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242437437] [2024-10-12 00:14:41,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:41,861 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 00:14:41,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-12 00:14:41,862 INFO L87 Difference]: Start difference. First operand 1374 states and 1745 transitions. cyclomatic complexity: 396 Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 11 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-12 00:14:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:42,054 INFO L93 Difference]: Finished difference Result 1483 states and 1923 transitions. [2024-10-12 00:14:42,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1483 states and 1923 transitions. [2024-10-12 00:14:42,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-10-12 00:14:42,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1483 states to 1208 states and 1502 transitions. [2024-10-12 00:14:42,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2024-10-12 00:14:42,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2024-10-12 00:14:42,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1208 states and 1502 transitions. [2024-10-12 00:14:42,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:42,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1208 states and 1502 transitions. [2024-10-12 00:14:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states and 1502 transitions. [2024-10-12 00:14:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1110. [2024-10-12 00:14:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 746 states have (on average 1.1032171581769437) internal successors, (823), 781 states have internal predecessors, (823), 218 states have call successors, (228), 138 states have call predecessors, (228), 146 states have return successors, (306), 190 states have call predecessors, (306), 200 states have call successors, (306) [2024-10-12 00:14:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1357 transitions. [2024-10-12 00:14:42,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1110 states and 1357 transitions. [2024-10-12 00:14:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 00:14:42,079 INFO L425 stractBuchiCegarLoop]: Abstraction has 1110 states and 1357 transitions. [2024-10-12 00:14:42,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-12 00:14:42,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1110 states and 1357 transitions. [2024-10-12 00:14:42,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-10-12 00:14:42,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:42,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:42,082 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-12 00:14:42,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:42,082 INFO L745 eck$LassoCheckResult]: Stem: 316221#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 316184#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; 316185#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; 316178#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; 316179#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 316239#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316263#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316264#$Ultimate##0 ~p := #in~p;~q := #in~q; 316266#L20 assume ~p <= 0;#res := 1; 316265#partsFINAL assume true; 316262#partsEXIT >#71#return; 316261#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316258#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316253#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316255#$Ultimate##0 ~p := #in~p;~q := #in~q; 316259#L20 assume ~p <= 0;#res := 1; 316256#partsFINAL assume true; 316252#partsEXIT >#71#return; 316251#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316249#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316245#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316246#$Ultimate##0 ~p := #in~p;~q := #in~q; 316250#L20 assume ~p <= 0;#res := 1; 316248#partsFINAL assume true; 316244#partsEXIT >#71#return; 316242#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316241#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 316203#L35-3 havoc main_~q~0#1; 316196#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 316197#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 316240#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316301#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316302#$Ultimate##0 ~p := #in~p;~q := #in~q; 316306#L20 assume !(~p <= 0); 316305#L21 assume ~q <= 0;#res := 0; 316304#partsFINAL assume true; 316300#partsEXIT >#71#return; 316299#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316297#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316289#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316294#$Ultimate##0 ~p := #in~p;~q := #in~q; 316507#L20 assume !(~p <= 0); 316506#L21 assume !(~q <= 0); 316504#L22 assume !(~q > ~p); 316497#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316498#$Ultimate##0 ~p := #in~p;~q := #in~q; 316500#L20 assume ~p <= 0;#res := 1; 316499#partsFINAL assume true; 316496#partsEXIT >#67#return; 316494#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316495#$Ultimate##0 ~p := #in~p;~q := #in~q; 316505#L20 assume !(~p <= 0); 316503#L21 assume ~q <= 0;#res := 0; 316501#partsFINAL assume true; 316493#partsEXIT >#69#return; 316491#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 316489#partsFINAL assume true; 316288#partsEXIT >#71#return; 316281#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316279#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316274#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316275#$Ultimate##0 ~p := #in~p;~q := #in~q; 316548#L20 assume !(~p <= 0); 316348#L21 assume !(~q <= 0); 316329#L22 assume ~q > ~p; 316311#L22-1 call #t~ret0 := parts(~p, ~p);< 316312#$Ultimate##0 ~p := #in~p;~q := #in~q; 316353#L20 assume !(~p <= 0); 316354#L21 assume !(~q <= 0); 316380#L22 assume !(~q > ~p); 316320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316321#$Ultimate##0 ~p := #in~p;~q := #in~q; 316425#L20 assume ~p <= 0;#res := 1; 316424#partsFINAL assume true; 316319#partsEXIT >#67#return; 316316#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316317#$Ultimate##0 ~p := #in~p;~q := #in~q; 316323#L20 assume !(~p <= 0); 316322#L21 assume ~q <= 0;#res := 0; 316318#partsFINAL assume true; 316315#partsEXIT >#69#return; 316314#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 316313#partsFINAL assume true; 316309#partsEXIT >#65#return; 316308#L22-2 #res := #t~ret0;havoc #t~ret0; 316307#partsFINAL assume true; 316272#partsEXIT >#71#return; 316267#L36-1 [2024-10-12 00:14:42,082 INFO L747 eck$LassoCheckResult]: Loop: 316267#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316222#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 316202#L35-3 havoc main_~q~0#1; 316194#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 316195#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 316243#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316180#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316181#$Ultimate##0 ~p := #in~p;~q := #in~q; 316271#L20 assume !(~p <= 0); 316270#L21 assume ~q <= 0;#res := 0; 316269#partsFINAL assume true; 316268#partsEXIT >#71#return; 316234#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316235#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316182#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316183#$Ultimate##0 ~p := #in~p;~q := #in~q; 316510#L20 assume !(~p <= 0); 316509#L21 assume !(~q <= 0); 316508#L22 assume !(~q > ~p); 316422#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316423#$Ultimate##0 ~p := #in~p;~q := #in~q; 316442#L20 assume !(~p <= 0); 316440#L21 assume !(~q <= 0); 316438#L22 assume !(~q > ~p); 316439#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316463#$Ultimate##0 ~p := #in~p;~q := #in~q; 316466#L20 assume ~p <= 0;#res := 1; 316465#partsFINAL assume true; 316462#partsEXIT >#67#return; 316458#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316460#$Ultimate##0 ~p := #in~p;~q := #in~q; 316469#L20 assume !(~p <= 0); 316468#L21 assume ~q <= 0;#res := 0; 316467#partsFINAL assume true; 316456#partsEXIT >#69#return; 316459#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 316930#partsFINAL assume true; 316927#partsEXIT >#67#return; 316916#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316917#$Ultimate##0 ~p := #in~p;~q := #in~q; 316932#L20 assume !(~p <= 0); 316929#L21 assume ~q <= 0;#res := 0; 316926#partsFINAL assume true; 316915#partsEXIT >#69#return; 316909#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 316902#partsFINAL assume true; 316899#partsEXIT >#71#return; 316898#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316897#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316187#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316295#$Ultimate##0 ~p := #in~p;~q := #in~q; 316346#L20 assume !(~p <= 0); 316344#L21 assume !(~q <= 0); 316341#L22 assume ~q > ~p; 316231#L22-1 call #t~ret0 := parts(~p, ~p);< 316336#$Ultimate##0 ~p := #in~p;~q := #in~q; 316532#L20 assume !(~p <= 0); 316531#L21 assume !(~q <= 0); 316529#L22 assume !(~q > ~p); 316361#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316526#$Ultimate##0 ~p := #in~p;~q := #in~q; 316547#L20 assume ~p <= 0;#res := 1; 316534#partsFINAL assume true; 316525#partsEXIT >#67#return; 316522#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316523#$Ultimate##0 ~p := #in~p;~q := #in~q; 316549#L20 assume !(~p <= 0); 316546#L21 assume ~q <= 0;#res := 0; 316524#partsFINAL assume true; 316521#partsEXIT >#69#return; 316520#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 316518#partsFINAL assume true; 316513#partsEXIT >#65#return; 316514#L22-2 #res := #t~ret0;havoc #t~ret0; 317251#partsFINAL assume true; 316292#partsEXIT >#71#return; 316293#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 316298#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 316188#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 316296#$Ultimate##0 ~p := #in~p;~q := #in~q; 316479#L20 assume !(~p <= 0); 316478#L21 assume !(~q <= 0); 316475#L22 assume ~q > ~p; 316285#L22-1 call #t~ret0 := parts(~p, ~p);< 316287#$Ultimate##0 ~p := #in~p;~q := #in~q; 316381#L20 assume !(~p <= 0); 316351#L21 assume !(~q <= 0); 316349#L22 assume !(~q > ~p); 316325#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316372#$Ultimate##0 ~p := #in~p;~q := #in~q; 316327#L20 assume ~p <= 0;#res := 1; 316324#partsFINAL assume true; 316326#partsEXIT >#67#return; 316316#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316317#$Ultimate##0 ~p := #in~p;~q := #in~q; 316323#L20 assume !(~p <= 0); 316322#L21 assume ~q <= 0;#res := 0; 316318#partsFINAL assume true; 316315#partsEXIT >#69#return; 316314#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 316313#partsFINAL assume true; 316309#partsEXIT >#65#return; 316280#L22-2 #res := #t~ret0;havoc #t~ret0; 316277#partsFINAL assume true; 316278#partsEXIT >#71#return; 316267#L36-1 [2024-10-12 00:14:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 7 times [2024-10-12 00:14:42,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:42,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340774911] [2024-10-12 00:14:42,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:42,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:42,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1270465335, now seen corresponding path program 5 times [2024-10-12 00:14:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575708459] [2024-10-12 00:14:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 00:14:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 00:14:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-12 00:14:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575708459] [2024-10-12 00:14:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575708459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902775764] [2024-10-12 00:14:42,275 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:42,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:42,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:42,277 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:42,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2024-10-12 00:14:42,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-12 00:14:42,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:42,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:42,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 294 proven. 68 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-12 00:14:42,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-12 00:14:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902775764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:42,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:42,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 14] total 29 [2024-10-12 00:14:42,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343557500] [2024-10-12 00:14:42,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:42,869 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 00:14:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2024-10-12 00:14:42,869 INFO L87 Difference]: Start difference. First operand 1110 states and 1357 transitions. cyclomatic complexity: 266 Second operand has 29 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 18 states have call successors, (29), 2 states have call predecessors, (29), 8 states have return successors, (30), 14 states have call predecessors, (30), 18 states have call successors, (30) [2024-10-12 00:14:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:43,437 INFO L93 Difference]: Finished difference Result 1260 states and 1584 transitions. [2024-10-12 00:14:43,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1260 states and 1584 transitions. [2024-10-12 00:14:43,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 [2024-10-12 00:14:43,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1260 states to 1218 states and 1504 transitions. [2024-10-12 00:14:43,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2024-10-12 00:14:43,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2024-10-12 00:14:43,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1218 states and 1504 transitions. [2024-10-12 00:14:43,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:43,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1218 states and 1504 transitions. [2024-10-12 00:14:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 1504 transitions. [2024-10-12 00:14:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1125. [2024-10-12 00:14:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 757 states have (on average 1.108322324966975) internal successors, (839), 793 states have internal predecessors, (839), 224 states have call successors, (232), 142 states have call predecessors, (232), 144 states have return successors, (304), 189 states have call predecessors, (304), 203 states have call successors, (304) [2024-10-12 00:14:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1375 transitions. [2024-10-12 00:14:43,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 1375 transitions. [2024-10-12 00:14:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-12 00:14:43,454 INFO L425 stractBuchiCegarLoop]: Abstraction has 1125 states and 1375 transitions. [2024-10-12 00:14:43,454 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-12 00:14:43,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 1375 transitions. [2024-10-12 00:14:43,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-10-12 00:14:43,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:43,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:43,457 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-12 00:14:43,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 30, 18, 14, 14, 14, 14, 14, 14, 12, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-12 00:14:43,457 INFO L745 eck$LassoCheckResult]: Stem: 319494#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 319445#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; 319446#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; 319443#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; 319444#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 319532#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319529#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319530#$Ultimate##0 ~p := #in~p;~q := #in~q; 319533#L20 assume ~p <= 0;#res := 1; 319531#partsFINAL assume true; 319528#partsEXIT >#71#return; 319527#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319524#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319519#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319521#$Ultimate##0 ~p := #in~p;~q := #in~q; 319525#L20 assume ~p <= 0;#res := 1; 319522#partsFINAL assume true; 319518#partsEXIT >#71#return; 319517#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319515#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319511#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319512#$Ultimate##0 ~p := #in~p;~q := #in~q; 319516#L20 assume ~p <= 0;#res := 1; 319514#partsFINAL assume true; 319510#partsEXIT >#71#return; 319509#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319508#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 319466#L35-3 havoc main_~q~0#1; 319463#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 319464#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 319507#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319716#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319717#$Ultimate##0 ~p := #in~p;~q := #in~q; 319728#L20 assume !(~p <= 0); 319726#L21 assume ~q <= 0;#res := 0; 319724#partsFINAL assume true; 319715#partsEXIT >#71#return; 319711#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319709#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319706#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319707#$Ultimate##0 ~p := #in~p;~q := #in~q; 319729#L20 assume !(~p <= 0); 319727#L21 assume !(~q <= 0); 319725#L22 assume !(~q > ~p); 319722#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319723#$Ultimate##0 ~p := #in~p;~q := #in~q; 319731#L20 assume ~p <= 0;#res := 1; 319730#partsFINAL assume true; 319721#partsEXIT >#67#return; 319713#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 319714#$Ultimate##0 ~p := #in~p;~q := #in~q; 319720#L20 assume !(~p <= 0); 319719#L21 assume ~q <= 0;#res := 0; 319718#partsFINAL assume true; 319712#partsEXIT >#69#return; 319710#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 319708#partsFINAL assume true; 319705#partsEXIT >#71#return; 319704#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319703#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319543#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319701#$Ultimate##0 ~p := #in~p;~q := #in~q; 319699#L20 assume !(~p <= 0); 319697#L21 assume !(~q <= 0); 319696#L22 assume ~q > ~p; 319552#L22-1 call #t~ret0 := parts(~p, ~p);< 319695#$Ultimate##0 ~p := #in~p;~q := #in~q; 319613#L20 assume !(~p <= 0); 319612#L21 assume !(~q <= 0); 319610#L22 assume !(~q > ~p); 319576#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319577#$Ultimate##0 ~p := #in~p;~q := #in~q; 319611#L20 assume ~p <= 0;#res := 1; 319609#partsFINAL assume true; 319575#partsEXIT >#67#return; 319564#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 319571#$Ultimate##0 ~p := #in~p;~q := #in~q; 319579#L20 assume !(~p <= 0); 319578#L21 assume ~q <= 0;#res := 0; 319574#partsFINAL assume true; 319563#partsEXIT >#69#return; 319561#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 319562#partsFINAL assume true; 319549#partsEXIT >#65#return; 319554#L22-2 #res := #t~ret0;havoc #t~ret0; 319542#partsFINAL assume true; 319544#partsEXIT >#71#return; 319535#L36-1 [2024-10-12 00:14:43,460 INFO L747 eck$LassoCheckResult]: Loop: 319535#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319534#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 319465#L35-3 havoc main_~q~0#1; 319461#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 319462#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 319495#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319447#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319448#$Ultimate##0 ~p := #in~p;~q := #in~q; 319548#L20 assume !(~p <= 0); 319545#L21 assume ~q <= 0;#res := 0; 319541#partsFINAL assume true; 319536#partsEXIT >#71#return; 319503#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319504#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319449#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319450#$Ultimate##0 ~p := #in~p;~q := #in~q; 320053#L20 assume !(~p <= 0); 320044#L21 assume !(~q <= 0); 320042#L22 assume !(~q > ~p); 319986#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319987#$Ultimate##0 ~p := #in~p;~q := #in~q; 320010#L20 assume !(~p <= 0); 320009#L21 assume !(~q <= 0); 320007#L22 assume !(~q > ~p); 319999#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320003#$Ultimate##0 ~p := #in~p;~q := #in~q; 320021#L20 assume !(~p <= 0); 320016#L21 assume !(~q <= 0); 320005#L22 assume !(~q > ~p); 320006#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320034#$Ultimate##0 ~p := #in~p;~q := #in~q; 320038#L20 assume ~p <= 0;#res := 1; 320036#partsFINAL assume true; 320033#partsEXIT >#67#return; 320029#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320031#$Ultimate##0 ~p := #in~p;~q := #in~q; 320037#L20 assume !(~p <= 0); 320035#L21 assume ~q <= 0;#res := 0; 320032#partsFINAL assume true; 320027#partsEXIT >#69#return; 320025#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320024#partsFINAL assume true; 320018#partsEXIT >#67#return; 320012#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320015#$Ultimate##0 ~p := #in~p;~q := #in~q; 320023#L20 assume !(~p <= 0); 320022#L21 assume ~q <= 0;#res := 0; 320017#partsFINAL assume true; 320011#partsEXIT >#69#return; 320014#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320226#partsFINAL assume true; 320224#partsEXIT >#67#return; 320214#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320215#$Ultimate##0 ~p := #in~p;~q := #in~q; 320222#L20 assume !(~p <= 0); 320221#L21 assume ~q <= 0;#res := 0; 320219#partsFINAL assume true; 320213#partsEXIT >#69#return; 320211#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320203#partsFINAL assume true; 320204#partsEXIT >#71#return; 320208#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 320207#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319455#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319607#$Ultimate##0 ~p := #in~p;~q := #in~q; 320245#L20 assume !(~p <= 0); 320243#L21 assume !(~q <= 0); 320233#L22 assume !(~q > ~p); 320177#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320178#$Ultimate##0 ~p := #in~p;~q := #in~q; 320191#L20 assume !(~p <= 0); 320187#L21 assume !(~q <= 0); 320185#L22 assume ~q > ~p; 320182#L22-1 call #t~ret0 := parts(~p, ~p);< 320183#$Ultimate##0 ~p := #in~p;~q := #in~q; 320200#L20 assume !(~p <= 0); 320197#L21 assume !(~q <= 0); 320196#L22 assume !(~q > ~p); 320194#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320195#$Ultimate##0 ~p := #in~p;~q := #in~q; 320202#L20 assume ~p <= 0;#res := 1; 320199#partsFINAL assume true; 320193#partsEXIT >#67#return; 320189#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320190#$Ultimate##0 ~p := #in~p;~q := #in~q; 320201#L20 assume !(~p <= 0); 320198#L21 assume ~q <= 0;#res := 0; 320192#partsFINAL assume true; 320188#partsEXIT >#69#return; 320186#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320184#partsFINAL assume true; 320181#partsEXIT >#65#return; 320180#L22-2 #res := #t~ret0;havoc #t~ret0; 320179#partsFINAL assume true; 320175#partsEXIT >#67#return; 319440#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320230#$Ultimate##0 ~p := #in~p;~q := #in~q; 320345#L20 assume !(~p <= 0); 320344#L21 assume !(~q <= 0); 320343#L22 assume !(~q > ~p); 320240#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320242#$Ultimate##0 ~p := #in~p;~q := #in~q; 320289#L20 assume !(~p <= 0); 320288#L21 assume !(~q <= 0); 320287#L22 assume ~q > ~p; 320257#L22-1 call #t~ret0 := parts(~p, ~p);< 320258#$Ultimate##0 ~p := #in~p;~q := #in~q; 320306#L20 assume !(~p <= 0); 320305#L21 assume !(~q <= 0); 320299#L22 assume !(~q > ~p); 320272#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320273#$Ultimate##0 ~p := #in~p;~q := #in~q; 320301#L20 assume ~p <= 0;#res := 1; 320297#partsFINAL assume true; 320271#partsEXIT >#67#return; 320269#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320270#$Ultimate##0 ~p := #in~p;~q := #in~q; 320285#L20 assume !(~p <= 0); 320277#L21 assume ~q <= 0;#res := 0; 320275#partsFINAL assume true; 320268#partsEXIT >#69#return; 320267#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320266#partsFINAL assume true; 320256#partsEXIT >#65#return; 320254#L22-2 #res := #t~ret0;havoc #t~ret0; 320248#partsFINAL assume true; 320238#partsEXIT >#67#return; 319441#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320230#$Ultimate##0 ~p := #in~p;~q := #in~q; 320345#L20 assume !(~p <= 0); 320344#L21 assume !(~q <= 0); 320343#L22 assume !(~q > ~p); 320263#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320265#$Ultimate##0 ~p := #in~p;~q := #in~q; 320334#L20 assume !(~p <= 0); 320328#L21 assume !(~q <= 0); 320329#L22 assume !(~q > ~p); 320291#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320496#$Ultimate##0 ~p := #in~p;~q := #in~q; 320494#L20 assume !(~p <= 0); 320490#L21 assume !(~q <= 0); 320489#L22 assume ~q > ~p; 320279#L22-1 call #t~ret0 := parts(~p, ~p);< 320284#$Ultimate##0 ~p := #in~p;~q := #in~q; 320324#L20 assume !(~p <= 0); 320323#L21 assume !(~q <= 0); 320322#L22 assume !(~q > ~p); 320310#L23 call #t~ret1 := parts(~p - ~q, ~q);< 320311#$Ultimate##0 ~p := #in~p;~q := #in~q; 320314#L20 assume ~p <= 0;#res := 1; 320313#partsFINAL assume true; 320309#partsEXIT >#67#return; 320303#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320304#$Ultimate##0 ~p := #in~p;~q := #in~q; 320312#L20 assume !(~p <= 0); 320308#L21 assume ~q <= 0;#res := 0; 320307#partsFINAL assume true; 320302#partsEXIT >#69#return; 320298#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320290#partsFINAL assume true; 320278#partsEXIT >#65#return; 320282#L22-2 #res := #t~ret0;havoc #t~ret0; 320519#partsFINAL assume true; 320518#partsEXIT >#67#return; 320425#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320432#$Ultimate##0 ~p := #in~p;~q := #in~q; 320513#L20 assume !(~p <= 0); 320512#L21 assume ~q <= 0;#res := 0; 320511#partsFINAL assume true; 320424#partsEXIT >#69#return; 320429#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320539#partsFINAL assume true; 320538#partsEXIT >#67#return; 320517#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320532#$Ultimate##0 ~p := #in~p;~q := #in~q; 320537#L20 assume !(~p <= 0); 320535#L21 assume ~q <= 0;#res := 0; 320534#partsFINAL assume true; 320530#partsEXIT >#69#return; 320531#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320548#partsFINAL assume true; 320546#partsEXIT >#69#return; 320531#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320548#partsFINAL assume true; 320546#partsEXIT >#69#return; 320209#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 320206#partsFINAL assume true; 320205#partsEXIT >#71#return; 319620#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 319618#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 319452#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 319606#$Ultimate##0 ~p := #in~p;~q := #in~q; 319605#L20 assume !(~p <= 0); 319603#L21 assume !(~q <= 0); 319601#L22 assume ~q > ~p; 319557#L22-1 call #t~ret0 := parts(~p, ~p);< 319598#$Ultimate##0 ~p := #in~p;~q := #in~q; 319597#L20 assume !(~p <= 0); 319596#L21 assume !(~q <= 0); 319592#L22 assume !(~q > ~p); 319581#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319587#$Ultimate##0 ~p := #in~p;~q := #in~q; 319594#L20 assume ~p <= 0;#res := 1; 319589#partsFINAL assume true; 319580#partsEXIT >#67#return; 319572#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 319573#$Ultimate##0 ~p := #in~p;~q := #in~q; 319662#L20 assume !(~p <= 0); 319659#L21 assume !(~q <= 0); 319654#L22 assume !(~q > ~p); 319649#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319650#$Ultimate##0 ~p := #in~p;~q := #in~q; 319848#L20 assume !(~p <= 0); 319845#L21 assume !(~q <= 0); 319842#L22 assume !(~q > ~p); 319834#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319837#$Ultimate##0 ~p := #in~p;~q := #in~q; 319885#L20 assume !(~p <= 0); 319882#L21 assume !(~q <= 0); 319856#L22 assume !(~q > ~p); 319676#L23 call #t~ret1 := parts(~p - ~q, ~q);< 319678#$Ultimate##0 ~p := #in~p;~q := #in~q; 319683#L20 assume ~p <= 0;#res := 1; 319680#partsFINAL assume true; 319674#partsEXIT >#67#return; 319667#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 319670#$Ultimate##0 ~p := #in~p;~q := #in~q; 319682#L20 assume !(~p <= 0); 319679#L21 assume ~q <= 0;#res := 0; 319672#partsFINAL assume true; 319664#partsEXIT >#69#return; 319668#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 319840#partsFINAL assume true; 319833#partsEXIT >#67#return; 319827#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 319830#$Ultimate##0 ~p := #in~p;~q := #in~q; 319841#L20 assume !(~p <= 0); 319839#L21 assume ~q <= 0;#res := 0; 319832#partsFINAL assume true; 319825#partsEXIT >#69#return; 319823#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 319820#partsFINAL assume true; 319732#partsEXIT >#67#return; 319642#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 320109#$Ultimate##0 ~p := #in~p;~q := #in~q; 320112#L20 assume !(~p <= 0); 320110#L21 assume ~q <= 0;#res := 0; 320108#partsFINAL assume true; 319640#partsEXIT >#69#return; 319638#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 319635#partsFINAL assume true; 319633#partsEXIT >#69#return; 319568#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 319556#partsFINAL assume true; 319560#partsEXIT >#65#return; 319546#L22-2 #res := #t~ret0;havoc #t~ret0; 319547#partsFINAL assume true; 319537#partsEXIT >#71#return; 319535#L36-1 [2024-10-12 00:14:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 8 times [2024-10-12 00:14:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721172112] [2024-10-12 00:14:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:43,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:43,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1785179033, now seen corresponding path program 6 times [2024-10-12 00:14:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476926665] [2024-10-12 00:14:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 00:14:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-12 00:14:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3415 backedges. 252 proven. 281 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2024-10-12 00:14:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476926665] [2024-10-12 00:14:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476926665] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055622546] [2024-10-12 00:14:43,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:43,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:43,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:43,726 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:43,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2024-10-12 00:14:43,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-10-12 00:14:43,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:43,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:14:43,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3415 backedges. 1659 proven. 126 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2024-10-12 00:14:43,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3415 backedges. 248 proven. 290 refuted. 0 times theorem prover too weak. 2877 trivial. 0 not checked. [2024-10-12 00:14:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055622546] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:44,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14 [2024-10-12 00:14:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867267096] [2024-10-12 00:14:44,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:44,290 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:14:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:14:44,290 INFO L87 Difference]: Start difference. First operand 1125 states and 1375 transitions. cyclomatic complexity: 271 Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 10 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2024-10-12 00:14:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:44,396 INFO L93 Difference]: Finished difference Result 1248 states and 1552 transitions. [2024-10-12 00:14:44,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1552 transitions. [2024-10-12 00:14:44,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2024-10-12 00:14:44,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 1237 states and 1529 transitions. [2024-10-12 00:14:44,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-10-12 00:14:44,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-10-12 00:14:44,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1237 states and 1529 transitions. [2024-10-12 00:14:44,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:44,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1237 states and 1529 transitions. [2024-10-12 00:14:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states and 1529 transitions. [2024-10-12 00:14:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1111. [2024-10-12 00:14:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 743 states have (on average 1.1090174966352624) internal successors, (824), 776 states have internal predecessors, (824), 230 states have call successors, (238), 140 states have call predecessors, (238), 138 states have return successors, (286), 194 states have call predecessors, (286), 209 states have call successors, (286) [2024-10-12 00:14:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1348 transitions. [2024-10-12 00:14:44,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1111 states and 1348 transitions. [2024-10-12 00:14:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:14:44,414 INFO L425 stractBuchiCegarLoop]: Abstraction has 1111 states and 1348 transitions. [2024-10-12 00:14:44,414 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-12 00:14:44,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1348 transitions. [2024-10-12 00:14:44,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-10-12 00:14:44,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:44,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:44,418 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-12 00:14:44,418 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-12 00:14:44,419 INFO L745 eck$LassoCheckResult]: Stem: 324269#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 324226#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; 324227#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; 324220#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; 324221#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 324287#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324331#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324332#$Ultimate##0 ~p := #in~p;~q := #in~q; 324334#L20 assume ~p <= 0;#res := 1; 324333#partsFINAL assume true; 324330#partsEXIT >#71#return; 324329#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324327#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324323#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324325#$Ultimate##0 ~p := #in~p;~q := #in~q; 324328#L20 assume ~p <= 0;#res := 1; 324326#partsFINAL assume true; 324322#partsEXIT >#71#return; 324311#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324308#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324294#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324295#$Ultimate##0 ~p := #in~p;~q := #in~q; 324300#L20 assume ~p <= 0;#res := 1; 324298#partsFINAL assume true; 324293#partsEXIT >#71#return; 324290#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324289#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 324248#L35-3 havoc main_~q~0#1; 324242#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 324243#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 324288#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324451#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324452#$Ultimate##0 ~p := #in~p;~q := #in~q; 324462#L20 assume !(~p <= 0); 324460#L21 assume ~q <= 0;#res := 0; 324458#partsFINAL assume true; 324450#partsEXIT >#71#return; 324446#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324444#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324441#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324442#$Ultimate##0 ~p := #in~p;~q := #in~q; 324463#L20 assume !(~p <= 0); 324461#L21 assume !(~q <= 0); 324459#L22 assume !(~q > ~p); 324456#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324457#$Ultimate##0 ~p := #in~p;~q := #in~q; 324466#L20 assume ~p <= 0;#res := 1; 324465#partsFINAL assume true; 324455#partsEXIT >#67#return; 324448#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324449#$Ultimate##0 ~p := #in~p;~q := #in~q; 324464#L20 assume !(~p <= 0); 324454#L21 assume ~q <= 0;#res := 0; 324453#partsFINAL assume true; 324447#partsEXIT >#69#return; 324445#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324443#partsFINAL assume true; 324440#partsEXIT >#71#return; 324439#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324321#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324304#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324437#$Ultimate##0 ~p := #in~p;~q := #in~q; 324436#L20 assume !(~p <= 0); 324435#L21 assume !(~q <= 0); 324434#L22 assume ~q > ~p; 324319#L22-1 call #t~ret0 := parts(~p, ~p);< 324320#$Ultimate##0 ~p := #in~p;~q := #in~q; 324368#L20 assume !(~p <= 0); 324367#L21 assume !(~q <= 0); 324364#L22 assume !(~q > ~p); 324360#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324361#$Ultimate##0 ~p := #in~p;~q := #in~q; 324366#L20 assume ~p <= 0;#res := 1; 324363#partsFINAL assume true; 324359#partsEXIT >#67#return; 324345#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324355#$Ultimate##0 ~p := #in~p;~q := #in~q; 324365#L20 assume !(~p <= 0); 324362#L21 assume ~q <= 0;#res := 0; 324358#partsFINAL assume true; 324344#partsEXIT >#69#return; 324346#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324432#partsFINAL assume true; 324429#partsEXIT >#65#return; 324312#L22-2 #res := #t~ret0;havoc #t~ret0; 324313#partsFINAL assume true; 324303#partsEXIT >#71#return; 324292#L36-1 [2024-10-12 00:14:44,419 INFO L747 eck$LassoCheckResult]: Loop: 324292#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324277#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 324247#L35-3 havoc main_~q~0#1; 324240#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 324241#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 324291#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324222#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324223#$Ultimate##0 ~p := #in~p;~q := #in~q; 324302#L20 assume !(~p <= 0); 324301#L21 assume ~q <= 0;#res := 0; 324299#partsFINAL assume true; 324297#partsEXIT >#71#return; 324281#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324282#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324224#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324225#$Ultimate##0 ~p := #in~p;~q := #in~q; 324506#L20 assume !(~p <= 0); 324500#L21 assume !(~q <= 0); 324497#L22 assume !(~q > ~p); 324493#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324494#$Ultimate##0 ~p := #in~p;~q := #in~q; 324530#L20 assume !(~p <= 0); 324528#L21 assume !(~q <= 0); 324523#L22 assume !(~q > ~p); 324524#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324541#$Ultimate##0 ~p := #in~p;~q := #in~q; 324545#L20 assume ~p <= 0;#res := 1; 324543#partsFINAL assume true; 324540#partsEXIT >#67#return; 324535#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324538#$Ultimate##0 ~p := #in~p;~q := #in~q; 324544#L20 assume !(~p <= 0); 324542#L21 assume ~q <= 0;#res := 0; 324539#partsFINAL assume true; 324534#partsEXIT >#69#return; 324537#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324817#partsFINAL assume true; 324746#partsEXIT >#67#return; 324718#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324719#$Ultimate##0 ~p := #in~p;~q := #in~q; 324733#L20 assume !(~p <= 0); 324730#L21 assume ~q <= 0;#res := 0; 324725#partsFINAL assume true; 324717#partsEXIT >#69#return; 324715#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324713#partsFINAL assume true; 324701#partsEXIT >#71#return; 324700#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324278#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324274#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324404#$Ultimate##0 ~p := #in~p;~q := #in~q; 324654#L20 assume !(~p <= 0); 324652#L21 assume !(~q <= 0); 324648#L22 assume !(~q > ~p); 324650#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324732#$Ultimate##0 ~p := #in~p;~q := #in~q; 324748#L20 assume ~p <= 0;#res := 1; 324747#partsFINAL assume true; 324731#partsEXIT >#67#return; 324657#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324686#$Ultimate##0 ~p := #in~p;~q := #in~q; 324687#L20 assume !(~p <= 0); 324656#L21 assume !(~q <= 0); 324658#L22 assume !(~q > ~p); 324575#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324579#$Ultimate##0 ~p := #in~p;~q := #in~q; 324869#L20 assume !(~p <= 0); 324867#L21 assume !(~q <= 0); 324868#L22 assume !(~q > ~p); 324782#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324785#$Ultimate##0 ~p := #in~p;~q := #in~q; 324820#L20 assume ~p <= 0;#res := 1; 324818#partsFINAL assume true; 324781#partsEXIT >#67#return; 324760#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324763#$Ultimate##0 ~p := #in~p;~q := #in~q; 324810#L20 assume !(~p <= 0); 324809#L21 assume ~q <= 0;#res := 0; 324807#partsFINAL assume true; 324757#partsEXIT >#69#return; 324755#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324754#partsFINAL assume true; 324750#partsEXIT >#67#return; 324742#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324745#$Ultimate##0 ~p := #in~p;~q := #in~q; 324808#L20 assume !(~p <= 0); 324806#L21 assume ~q <= 0;#res := 0; 324749#partsFINAL assume true; 324741#partsEXIT >#69#return; 324739#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324734#partsFINAL assume true; 324727#partsEXIT >#69#return; 324724#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324712#partsFINAL assume true; 324698#partsEXIT >#71#return; 324411#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 324409#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 324272#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 324403#$Ultimate##0 ~p := #in~p;~q := #in~q; 324401#L20 assume !(~p <= 0); 324399#L21 assume !(~q <= 0); 324394#L22 assume ~q > ~p; 324315#L22-1 call #t~ret0 := parts(~p, ~p);< 324392#$Ultimate##0 ~p := #in~p;~q := #in~q; 324389#L20 assume !(~p <= 0); 324388#L21 assume !(~q <= 0); 324384#L22 assume !(~q > ~p); 324372#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324378#$Ultimate##0 ~p := #in~p;~q := #in~q; 324386#L20 assume ~p <= 0;#res := 1; 324380#partsFINAL assume true; 324371#partsEXIT >#67#return; 324356#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 324357#$Ultimate##0 ~p := #in~p;~q := #in~q; 324958#L20 assume !(~p <= 0); 324957#L21 assume !(~q <= 0); 324956#L22 assume !(~q > ~p); 324952#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324955#$Ultimate##0 ~p := #in~p;~q := #in~q; 325189#L20 assume !(~p <= 0); 325186#L21 assume !(~q <= 0); 325181#L22 assume !(~q > ~p); 325177#L23 call #t~ret1 := parts(~p - ~q, ~q);< 324232#$Ultimate##0 ~p := #in~p;~q := #in~q; 325183#L20 assume ~p <= 0;#res := 1; 325179#partsFINAL assume true; 325175#partsEXIT >#67#return; 325167#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 325172#$Ultimate##0 ~p := #in~p;~q := #in~q; 325182#L20 assume !(~p <= 0); 325178#L21 assume ~q <= 0;#res := 0; 325173#partsFINAL assume true; 325166#partsEXIT >#69#return; 325164#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 325162#partsFINAL assume true; 325156#partsEXIT >#67#return; 324690#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 325149#$Ultimate##0 ~p := #in~p;~q := #in~q; 325160#L20 assume !(~p <= 0); 325155#L21 assume ~q <= 0;#res := 0; 325148#partsFINAL assume true; 324688#partsEXIT >#69#return; 324551#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324550#partsFINAL assume true; 324548#partsEXIT >#69#return; 324342#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 324339#partsFINAL assume true; 324314#partsEXIT >#65#return; 324317#L22-2 #res := #t~ret0;havoc #t~ret0; 324309#partsFINAL assume true; 324310#partsEXIT >#71#return; 324292#L36-1 [2024-10-12 00:14:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 9 times [2024-10-12 00:14:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949165602] [2024-10-12 00:14:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:44,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash -231649768, now seen corresponding path program 7 times [2024-10-12 00:14:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061809282] [2024-10-12 00:14:44,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:44,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1877905397, now seen corresponding path program 10 times [2024-10-12 00:14:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941974589] [2024-10-12 00:14:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 00:14:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 00:14:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 00:14:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-12 00:14:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-12 00:14:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,603 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-12 00:14:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941974589] [2024-10-12 00:14:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941974589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363348470] [2024-10-12 00:14:44,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:44,605 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:44,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2024-10-12 00:14:44,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:44,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:44,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:44,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:44,789 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-12 00:14:44,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:44,987 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-12 00:14:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363348470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:44,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2024-10-12 00:14:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317318268] [2024-10-12 00:14:44,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:45,980 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:45,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:45,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:45,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:45,980 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:45,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:45,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:45,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2024-10-12 00:14:45,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:45,980 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:45,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:46,009 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:46,009 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:46,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,011 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-12 00:14:46,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:46,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:46,023 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:46,023 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-12 00:14:46,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-10-12 00:14:46,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,034 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-12 00:14:46,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:46,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:46,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-10-12 00:14:46,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,057 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-12 00:14:46,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:46,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:46,069 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:46,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-10-12 00:14:46,079 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:46,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:46,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:46,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:46,079 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:46,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:46,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:46,079 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2024-10-12 00:14:46,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:46,079 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:46,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:46,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:46,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:46,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:46,106 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:46,106 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:46,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,107 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-12 00:14:46,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:46,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:46,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:46,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:46,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:46,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:46,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:46,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:46,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:46,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-10-12 00:14:46,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,131 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-12 00:14:46,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:46,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:46,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:46,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:46,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:46,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:46,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:46,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:46,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:46,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-10-12 00:14:46,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,154 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-12 00:14:46,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:46,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:46,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:46,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:46,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:46,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:46,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:46,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:46,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:46,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:46,168 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:46,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:46,170 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:46,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-12 00:14:46,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:46,171 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:46,171 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:46,171 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-12 00:14:46,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-10-12 00:14:46,181 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:46,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:14:46,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-12 00:14:46,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:46,875 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-12 00:14:46,875 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-12 00:14:46,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1111 states and 1348 transitions. cyclomatic complexity: 257 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-12 00:14:47,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1111 states and 1348 transitions. cyclomatic complexity: 257. 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 2946 states and 3699 transitions. Complement of second has 119 states. [2024-10-12 00:14:47,143 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-12 00:14:47,143 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-12 00:14:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2024-10-12 00:14:47,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 87 letters. Loop has 151 letters. [2024-10-12 00:14:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:47,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 238 letters. Loop has 151 letters. [2024-10-12 00:14:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:47,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 87 letters. Loop has 302 letters. [2024-10-12 00:14:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:47,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2946 states and 3699 transitions. [2024-10-12 00:14:47,153 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2024-10-12 00:14:47,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2946 states to 2496 states and 3115 transitions. [2024-10-12 00:14:47,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2024-10-12 00:14:47,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 311 [2024-10-12 00:14:47,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2496 states and 3115 transitions. [2024-10-12 00:14:47,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:47,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2496 states and 3115 transitions. [2024-10-12 00:14:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states and 3115 transitions. [2024-10-12 00:14:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2107. [2024-10-12 00:14:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1377 states have (on average 1.0958605664488017) internal successors, (1509), 1450 states have internal predecessors, (1509), 453 states have call successors, (466), 247 states have call predecessors, (466), 277 states have return successors, (618), 409 states have call predecessors, (618), 430 states have call successors, (618) [2024-10-12 00:14:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2593 transitions. [2024-10-12 00:14:47,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2107 states and 2593 transitions. [2024-10-12 00:14:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:47,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 00:14:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-12 00:14:47,226 INFO L87 Difference]: Start difference. First operand 2107 states and 2593 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-12 00:14:47,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-10-12 00:14:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:47,306 INFO L93 Difference]: Finished difference Result 2219 states and 2768 transitions. [2024-10-12 00:14:47,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2219 states and 2768 transitions. [2024-10-12 00:14:47,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 81 [2024-10-12 00:14:47,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2219 states to 2191 states and 2728 transitions. [2024-10-12 00:14:47,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2024-10-12 00:14:47,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2024-10-12 00:14:47,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2191 states and 2728 transitions. [2024-10-12 00:14:47,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:47,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2191 states and 2728 transitions. [2024-10-12 00:14:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states and 2728 transitions. [2024-10-12 00:14:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2156. [2024-10-12 00:14:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1413 states have (on average 1.0941259731068649) internal successors, (1546), 1488 states have internal predecessors, (1546), 466 states have call successors, (481), 247 states have call predecessors, (481), 277 states have return successors, (631), 420 states have call predecessors, (631), 440 states have call successors, (631) [2024-10-12 00:14:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2658 transitions. [2024-10-12 00:14:47,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2156 states and 2658 transitions. [2024-10-12 00:14:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:14:47,338 INFO L425 stractBuchiCegarLoop]: Abstraction has 2156 states and 2658 transitions. [2024-10-12 00:14:47,338 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-12 00:14:47,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2156 states and 2658 transitions. [2024-10-12 00:14:47,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 76 [2024-10-12 00:14:47,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:47,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:47,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 16, 14, 10, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:47,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-12 00:14:47,344 INFO L745 eck$LassoCheckResult]: Stem: 335408#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 335366#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; 335367#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; 335364#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; 335365#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 335533#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 335530#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 335531#$Ultimate##0 ~p := #in~p;~q := #in~q; 335534#L20 assume ~p <= 0;#res := 1; 335532#partsFINAL assume true; 335529#partsEXIT >#71#return; 335528#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 335526#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 335523#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 335524#$Ultimate##0 ~p := #in~p;~q := #in~q; 335527#L20 assume ~p <= 0;#res := 1; 335525#partsFINAL assume true; 335522#partsEXIT >#71#return; 335521#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 335519#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 335515#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 335517#$Ultimate##0 ~p := #in~p;~q := #in~q; 335520#L20 assume ~p <= 0;#res := 1; 335518#partsFINAL assume true; 335513#partsEXIT >#71#return; 335512#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 335511#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 335510#L35-3 havoc main_~q~0#1; 335509#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 335507#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 335505#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 335470#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 335472#$Ultimate##0 ~p := #in~p;~q := #in~q; 335508#L20 assume !(~p <= 0); 335506#L21 assume ~q <= 0;#res := 0; 335504#partsFINAL assume true; 335468#partsEXIT >#71#return; 335461#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 335458#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 335452#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 335455#$Ultimate##0 ~p := #in~p;~q := #in~q; 335497#L20 assume !(~p <= 0); 335495#L21 assume !(~q <= 0); 335493#L22 assume !(~q > ~p); 335490#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335491#$Ultimate##0 ~p := #in~p;~q := #in~q; 335503#L20 assume ~p <= 0;#res := 1; 335502#partsFINAL assume true; 335489#partsEXIT >#67#return; 335463#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335464#$Ultimate##0 ~p := #in~p;~q := #in~q; 335480#L20 assume !(~p <= 0); 335478#L21 assume ~q <= 0;#res := 0; 335476#partsFINAL assume true; 335462#partsEXIT >#69#return; 335459#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 335457#partsFINAL assume true; 335451#partsEXIT >#71#return; 335445#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 335443#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 335429#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 335438#$Ultimate##0 ~p := #in~p;~q := #in~q; 335546#L20 assume !(~p <= 0); 335542#L21 assume !(~q <= 0); 335543#L22 assume ~q > ~p; 335448#L22-1 call #t~ret0 := parts(~p, ~p);< 335450#$Ultimate##0 ~p := #in~p;~q := #in~q; 335893#L20 assume !(~p <= 0); 335890#L21 assume !(~q <= 0); 335887#L22 assume !(~q > ~p); 335873#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335886#$Ultimate##0 ~p := #in~p;~q := #in~q; 336017#L20 assume ~p <= 0;#res := 1; 336016#partsFINAL assume true; 335885#partsEXIT >#67#return; 335862#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335882#$Ultimate##0 ~p := #in~p;~q := #in~q; 335880#L20 assume !(~p <= 0); 335878#L21 assume !(~q <= 0); 335871#L22 assume !(~q > ~p); 335868#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335870#$Ultimate##0 ~p := #in~p;~q := #in~q; 336036#L20 assume !(~p <= 0); 336034#L21 assume !(~q <= 0); 336030#L22 assume ~q > ~p; 336027#L22-1 call #t~ret0 := parts(~p, ~p);< 336028#$Ultimate##0 ~p := #in~p;~q := #in~q; 336060#L20 assume !(~p <= 0); 336059#L21 assume !(~q <= 0); 336057#L22 assume !(~q > ~p); 336054#L23 call #t~ret1 := parts(~p - ~q, ~q);< 336055#$Ultimate##0 ~p := #in~p;~q := #in~q; 336062#L20 assume ~p <= 0;#res := 1; 336061#partsFINAL assume true; 336053#partsEXIT >#67#return; 336050#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 336051#$Ultimate##0 ~p := #in~p;~q := #in~q; 336065#L20 assume !(~p <= 0); 336064#L21 assume ~q <= 0;#res := 0; 336063#partsFINAL assume true; 336049#partsEXIT >#69#return; 336045#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 336041#partsFINAL assume true; 336026#partsEXIT >#65#return; 336024#L22-2 #res := #t~ret0;havoc #t~ret0; 336023#partsFINAL assume true; 335867#partsEXIT >#67#return; 335581#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335859#$Ultimate##0 ~p := #in~p;~q := #in~q; 335857#L20 assume !(~p <= 0); 335856#L21 assume !(~q <= 0); 335599#L22 assume !(~q > ~p); 335589#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335592#$Ultimate##0 ~p := #in~p;~q := #in~q; 335613#L20 assume !(~p <= 0); 335609#L21 assume !(~q <= 0); 335607#L22 assume ~q > ~p; 335604#L22-1 call #t~ret0 := parts(~p, ~p);< 335605#$Ultimate##0 ~p := #in~p;~q := #in~q; 335624#L20 assume !(~p <= 0); 335623#L21 assume !(~q <= 0); 335620#L22 assume !(~q > ~p); 335616#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335617#$Ultimate##0 ~p := #in~p;~q := #in~q; 335621#L20 assume ~p <= 0;#res := 1; 335618#partsFINAL assume true; 335615#partsEXIT >#67#return; 335611#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335612#$Ultimate##0 ~p := #in~p;~q := #in~q; 335622#L20 assume !(~p <= 0); 335619#L21 assume ~q <= 0;#res := 0; 335614#partsFINAL assume true; 335610#partsEXIT >#69#return; 335608#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 335606#partsFINAL assume true; 335603#partsEXIT >#65#return; 335602#L22-2 #res := #t~ret0;havoc #t~ret0; 335593#partsFINAL assume true; 335586#partsEXIT >#67#return; 335582#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335584#$Ultimate##0 ~p := #in~p;~q := #in~q; 335853#L20 assume !(~p <= 0); 335852#L21 assume !(~q <= 0); 335767#L22 assume ~q > ~p; 335768#L22-1 [2024-10-12 00:14:47,344 INFO L747 eck$LassoCheckResult]: Loop: 335768#L22-1 call #t~ret0 := parts(~p, ~p);< 335884#$Ultimate##0 ~p := #in~p;~q := #in~q; 335883#L20 assume !(~p <= 0); 335881#L21 assume !(~q <= 0); 335879#L22 assume !(~q > ~p); 335875#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335877#$Ultimate##0 ~p := #in~p;~q := #in~q; 336022#L20 assume ~p <= 0;#res := 1; 336020#partsFINAL assume true; 335874#partsEXIT >#67#return; 335566#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335863#$Ultimate##0 ~p := #in~p;~q := #in~q; 335864#L20 assume !(~p <= 0); 335843#L21 assume !(~q <= 0); 335844#L22 assume !(~q > ~p); 335587#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335592#$Ultimate##0 ~p := #in~p;~q := #in~q; 335613#L20 assume !(~p <= 0); 335609#L21 assume !(~q <= 0); 335607#L22 assume ~q > ~p; 335604#L22-1 call #t~ret0 := parts(~p, ~p);< 335605#$Ultimate##0 ~p := #in~p;~q := #in~q; 335624#L20 assume !(~p <= 0); 335623#L21 assume !(~q <= 0); 335620#L22 assume !(~q > ~p); 335616#L23 call #t~ret1 := parts(~p - ~q, ~q);< 335617#$Ultimate##0 ~p := #in~p;~q := #in~q; 335621#L20 assume ~p <= 0;#res := 1; 335618#partsFINAL assume true; 335615#partsEXIT >#67#return; 335611#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335612#$Ultimate##0 ~p := #in~p;~q := #in~q; 335622#L20 assume !(~p <= 0); 335619#L21 assume ~q <= 0;#res := 0; 335614#partsFINAL assume true; 335610#partsEXIT >#69#return; 335608#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 335606#partsFINAL assume true; 335603#partsEXIT >#65#return; 335602#L22-2 #res := #t~ret0;havoc #t~ret0; 335593#partsFINAL assume true; 335586#partsEXIT >#67#return; 335580#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 335584#$Ultimate##0 ~p := #in~p;~q := #in~q; 335853#L20 assume !(~p <= 0); 335852#L21 assume !(~q <= 0); 335767#L22 assume ~q > ~p; 335768#L22-1 [2024-10-12 00:14:47,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash 350450061, now seen corresponding path program 11 times [2024-10-12 00:14:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775968646] [2024-10-12 00:14:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 00:14:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 00:14:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 00:14:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 00:14:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 176 proven. 140 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2024-10-12 00:14:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775968646] [2024-10-12 00:14:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775968646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736055410] [2024-10-12 00:14:47,439 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:47,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:47,441 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:47,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2024-10-12 00:14:47,519 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-12 00:14:47,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:47,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 00:14:47,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 329 proven. 88 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2024-10-12 00:14:47,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 329 proven. 90 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-10-12 00:14:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736055410] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:47,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 21 [2024-10-12 00:14:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593843072] [2024-10-12 00:14:47,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:47,898 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:47,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash 851588807, now seen corresponding path program 1 times [2024-10-12 00:14:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763861608] [2024-10-12 00:14:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 00:14:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 00:14:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,961 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-12 00:14:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763861608] [2024-10-12 00:14:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763861608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017592863] [2024-10-12 00:14:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:47,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:47,963 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:47,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2024-10-12 00:14:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:48,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:48,048 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-12 00:14:48,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:48,124 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-12 00:14:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017592863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:48,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:48,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:14:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190650136] [2024-10-12 00:14:48,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:48,125 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:14:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:14:48,126 INFO L87 Difference]: Start difference. First operand 2156 states and 2658 transitions. cyclomatic complexity: 531 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-12 00:14:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:48,215 INFO L93 Difference]: Finished difference Result 2291 states and 2804 transitions. [2024-10-12 00:14:48,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2291 states and 2804 transitions. [2024-10-12 00:14:48,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2024-10-12 00:14:48,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2291 states to 2037 states and 2482 transitions. [2024-10-12 00:14:48,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2024-10-12 00:14:48,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2024-10-12 00:14:48,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2037 states and 2482 transitions. [2024-10-12 00:14:48,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:48,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2037 states and 2482 transitions. [2024-10-12 00:14:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states and 2482 transitions. [2024-10-12 00:14:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1995. [2024-10-12 00:14:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1301 states have (on average 1.0714834742505766) internal successors, (1394), 1368 states have internal predecessors, (1394), 419 states have call successors, (426), 225 states have call predecessors, (426), 275 states have return successors, (604), 401 states have call predecessors, (604), 419 states have call successors, (604) [2024-10-12 00:14:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2424 transitions. [2024-10-12 00:14:48,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1995 states and 2424 transitions. [2024-10-12 00:14:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:14:48,243 INFO L425 stractBuchiCegarLoop]: Abstraction has 1995 states and 2424 transitions. [2024-10-12 00:14:48,243 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-12 00:14:48,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1995 states and 2424 transitions. [2024-10-12 00:14:48,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2024-10-12 00:14:48,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:48,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:48,247 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-12 00:14:48,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 24, 14, 11, 11, 11, 11, 11, 11, 10, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2024-10-12 00:14:48,247 INFO L745 eck$LassoCheckResult]: Stem: 341247#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 341202#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; 341203#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; 341196#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; 341197#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341261#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341385#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341386#$Ultimate##0 ~p := #in~p;~q := #in~q; 341389#L20 assume ~p <= 0;#res := 1; 341387#partsFINAL assume true; 341384#partsEXIT >#71#return; 341383#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341382#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341379#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341380#$Ultimate##0 ~p := #in~p;~q := #in~q; 341390#L20 assume ~p <= 0;#res := 1; 341388#partsFINAL assume true; 341378#partsEXIT >#71#return; 341376#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341375#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341374#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341368#$Ultimate##0 ~p := #in~p;~q := #in~q; 341381#L20 assume ~p <= 0;#res := 1; 341377#partsFINAL assume true; 341373#partsEXIT >#71#return; 341372#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341371#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341367#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341369#$Ultimate##0 ~p := #in~p;~q := #in~q; 341392#L20 assume ~p <= 0;#res := 1; 341391#partsFINAL assume true; 341366#partsEXIT >#71#return; 341273#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341274#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 341345#L35-3 havoc main_~q~0#1; 341343#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 341341#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341340#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341338#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341339#$Ultimate##0 ~p := #in~p;~q := #in~q; 341346#L20 assume !(~p <= 0); 341344#L21 assume ~q <= 0;#res := 0; 341342#partsFINAL assume true; 341337#partsEXIT >#71#return; 341336#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341330#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341314#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341315#$Ultimate##0 ~p := #in~p;~q := #in~q; 341405#L20 assume !(~p <= 0); 341404#L21 assume !(~q <= 0); 341403#L22 assume !(~q > ~p); 341355#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341356#$Ultimate##0 ~p := #in~p;~q := #in~q; 341402#L20 assume ~p <= 0;#res := 1; 341401#partsFINAL assume true; 341354#partsEXIT >#67#return; 341334#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341335#$Ultimate##0 ~p := #in~p;~q := #in~q; 341397#L20 assume !(~p <= 0); 341396#L21 assume ~q <= 0;#res := 0; 341347#partsFINAL assume true; 341333#partsEXIT >#69#return; 341329#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341326#partsFINAL assume true; 341313#partsEXIT >#71#return; 341306#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341301#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341298#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341268#$Ultimate##0 ~p := #in~p;~q := #in~q; 341332#L20 assume !(~p <= 0); 341328#L21 assume !(~q <= 0); 341325#L22 assume ~q > ~p; 341311#L22-1 call #t~ret0 := parts(~p, ~p);< 341312#$Ultimate##0 ~p := #in~p;~q := #in~q; 341363#L20 assume !(~p <= 0); 341361#L21 assume !(~q <= 0); 341360#L22 assume !(~q > ~p); 341358#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341359#$Ultimate##0 ~p := #in~p;~q := #in~q; 341364#L20 assume ~p <= 0;#res := 1; 341362#partsFINAL assume true; 341357#partsEXIT >#67#return; 341322#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341323#$Ultimate##0 ~p := #in~p;~q := #in~q; 341331#L20 assume !(~p <= 0); 341327#L21 assume ~q <= 0;#res := 0; 341324#partsFINAL assume true; 341321#partsEXIT >#69#return; 341320#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341318#partsFINAL assume true; 341310#partsEXIT >#65#return; 341305#L22-2 #res := #t~ret0;havoc #t~ret0; 341300#partsFINAL assume true; 341297#partsEXIT >#71#return; 341295#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341293#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341266#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341269#$Ultimate##0 ~p := #in~p;~q := #in~q; 341319#L20 assume !(~p <= 0); 341317#L21 assume !(~q <= 0); 341309#L22 assume ~q > ~p; 341303#L22-1 call #t~ret0 := parts(~p, ~p);< 341304#$Ultimate##0 ~p := #in~p;~q := #in~q; 341400#L20 assume !(~p <= 0); 341399#L21 assume !(~q <= 0); 341398#L22 assume !(~q > ~p); 341352#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341353#$Ultimate##0 ~p := #in~p;~q := #in~q; 341370#L20 assume ~p <= 0;#res := 1; 341365#partsFINAL assume true; 341351#partsEXIT >#67#return; 341349#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341350#$Ultimate##0 ~p := #in~p;~q := #in~q; 341395#L20 assume !(~p <= 0); 341394#L21 assume ~q <= 0;#res := 0; 341393#partsFINAL assume true; 341348#partsEXIT >#69#return; 341316#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341308#partsFINAL assume true; 341302#partsEXIT >#65#return; 341299#L22-2 #res := #t~ret0;havoc #t~ret0; 341296#partsFINAL assume true; 341265#partsEXIT >#71#return; 341267#L36-1 [2024-10-12 00:14:48,248 INFO L747 eck$LassoCheckResult]: Loop: 341267#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341248#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 341219#L35-3 havoc main_~q~0#1; 341211#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 341212#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341262#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341198#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341199#$Ultimate##0 ~p := #in~p;~q := #in~q; 341272#L20 assume !(~p <= 0); 341271#L21 assume ~q <= 0;#res := 0; 341270#partsFINAL assume true; 341264#partsEXIT >#71#return; 341256#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341257#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 342167#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342168#$Ultimate##0 ~p := #in~p;~q := #in~q; 342193#L20 assume !(~p <= 0); 342191#L21 assume !(~q <= 0); 342189#L22 assume !(~q > ~p); 342180#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342181#$Ultimate##0 ~p := #in~p;~q := #in~q; 342269#L20 assume !(~p <= 0); 342246#L21 assume !(~q <= 0); 342241#L22 assume !(~q > ~p); 342200#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342202#$Ultimate##0 ~p := #in~p;~q := #in~q; 342210#L20 assume !(~p <= 0); 342209#L21 assume !(~q <= 0); 342207#L22 assume !(~q > ~p); 342208#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342224#$Ultimate##0 ~p := #in~p;~q := #in~q; 342227#L20 assume ~p <= 0;#res := 1; 342225#partsFINAL assume true; 342223#partsEXIT >#67#return; 342221#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342222#$Ultimate##0 ~p := #in~p;~q := #in~q; 342229#L20 assume !(~p <= 0); 342228#L21 assume ~q <= 0;#res := 0; 342226#partsFINAL assume true; 342220#partsEXIT >#69#return; 342218#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342217#partsFINAL assume true; 342216#partsEXIT >#67#return; 342213#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342215#$Ultimate##0 ~p := #in~p;~q := #in~q; 342231#L20 assume !(~p <= 0); 342230#L21 assume ~q <= 0;#res := 0; 342219#partsFINAL assume true; 342211#partsEXIT >#69#return; 342214#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342188#partsFINAL assume true; 342179#partsEXIT >#67#return; 342175#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342176#$Ultimate##0 ~p := #in~p;~q := #in~q; 342187#L20 assume !(~p <= 0); 342185#L21 assume ~q <= 0;#res := 0; 342178#partsFINAL assume true; 342174#partsEXIT >#69#return; 342172#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342170#partsFINAL assume true; 342166#partsEXIT >#71#return; 342164#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 342163#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341289#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342085#$Ultimate##0 ~p := #in~p;~q := #in~q; 342341#L20 assume !(~p <= 0); 342340#L21 assume !(~q <= 0); 342337#L22 assume !(~q > ~p); 342129#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342132#$Ultimate##0 ~p := #in~p;~q := #in~q; 342151#L20 assume !(~p <= 0); 342147#L21 assume !(~q <= 0); 342145#L22 assume ~q > ~p; 342141#L22-1 call #t~ret0 := parts(~p, ~p);< 342142#$Ultimate##0 ~p := #in~p;~q := #in~q; 342162#L20 assume !(~p <= 0); 342161#L21 assume !(~q <= 0); 342158#L22 assume !(~q > ~p); 342154#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342155#$Ultimate##0 ~p := #in~p;~q := #in~q; 342160#L20 assume ~p <= 0;#res := 1; 342157#partsFINAL assume true; 342153#partsEXIT >#67#return; 342149#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342150#$Ultimate##0 ~p := #in~p;~q := #in~q; 342159#L20 assume !(~p <= 0); 342156#L21 assume ~q <= 0;#res := 0; 342152#partsFINAL assume true; 342148#partsEXIT >#69#return; 342146#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342144#partsFINAL assume true; 342140#partsEXIT >#65#return; 342138#L22-2 #res := #t~ret0;havoc #t~ret0; 342134#partsFINAL assume true; 342128#partsEXIT >#67#return; 342096#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342099#$Ultimate##0 ~p := #in~p;~q := #in~q; 342665#L20 assume !(~p <= 0); 342630#L21 assume !(~q <= 0); 342285#L22 assume !(~q > ~p); 342119#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342126#$Ultimate##0 ~p := #in~p;~q := #in~q; 342574#L20 assume !(~p <= 0); 342569#L21 assume !(~q <= 0); 342567#L22 assume !(~q > ~p); 342375#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342490#$Ultimate##0 ~p := #in~p;~q := #in~q; 342545#L20 assume !(~p <= 0); 342543#L21 assume !(~q <= 0); 342544#L22 assume !(~q > ~p); 342523#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342526#$Ultimate##0 ~p := #in~p;~q := #in~q; 342532#L20 assume ~p <= 0;#res := 1; 342528#partsFINAL assume true; 342522#partsEXIT >#67#return; 342403#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342406#$Ultimate##0 ~p := #in~p;~q := #in~q; 342469#L20 assume !(~p <= 0); 342468#L21 assume ~q <= 0;#res := 0; 342466#partsFINAL assume true; 342400#partsEXIT >#69#return; 342398#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342395#partsFINAL assume true; 342390#partsEXIT >#67#return; 342384#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342388#$Ultimate##0 ~p := #in~p;~q := #in~q; 342503#L20 assume !(~p <= 0); 342502#L21 assume ~q <= 0;#res := 0; 342471#partsFINAL assume true; 342383#partsEXIT >#69#return; 342387#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342448#partsFINAL assume true; 342116#partsEXIT >#67#return; 342124#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342495#$Ultimate##0 ~p := #in~p;~q := #in~q; 342513#L20 assume !(~p <= 0); 342511#L21 assume ~q <= 0;#res := 0; 342500#partsFINAL assume true; 342492#partsEXIT >#69#return; 342334#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342470#partsFINAL assume true; 342370#partsEXIT >#69#return; 342356#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342354#partsFINAL assume true; 342353#partsEXIT >#71#return; 341285#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341281#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341282#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 342089#$Ultimate##0 ~p := #in~p;~q := #in~q; 342114#L20 assume !(~p <= 0); 341437#L21 assume !(~q <= 0); 341438#L22 assume ~q > ~p; 341408#L22-1 call #t~ret0 := parts(~p, ~p);< 341410#$Ultimate##0 ~p := #in~p;~q := #in~q; 341435#L20 assume !(~p <= 0); 341433#L21 assume !(~q <= 0); 341429#L22 assume !(~q > ~p); 341423#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341425#$Ultimate##0 ~p := #in~p;~q := #in~q; 341431#L20 assume ~p <= 0;#res := 1; 341427#partsFINAL assume true; 341422#partsEXIT >#67#return; 341418#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341464#$Ultimate##0 ~p := #in~p;~q := #in~q; 341460#L20 assume !(~p <= 0); 341454#L21 assume !(~q <= 0); 341452#L22 assume !(~q > ~p); 341232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341514#$Ultimate##0 ~p := #in~p;~q := #in~q; 341617#L20 assume !(~p <= 0); 341615#L21 assume !(~q <= 0); 341616#L22 assume ~q > ~p; 341207#L22-1 call #t~ret0 := parts(~p, ~p);< 341234#$Ultimate##0 ~p := #in~p;~q := #in~q; 341691#L20 assume !(~p <= 0); 341690#L21 assume !(~q <= 0); 341689#L22 assume !(~q > ~p); 341204#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341208#$Ultimate##0 ~p := #in~p;~q := #in~q; 341599#L20 assume ~p <= 0;#res := 1; 341598#partsFINAL assume true; 341595#partsEXIT >#67#return; 341592#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341593#$Ultimate##0 ~p := #in~p;~q := #in~q; 341609#L20 assume !(~p <= 0); 341607#L21 assume ~q <= 0;#res := 0; 341605#partsFINAL assume true; 341591#partsEXIT >#69#return; 341588#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341586#partsFINAL assume true; 341568#partsEXIT >#65#return; 341251#L22-2 #res := #t~ret0;havoc #t~ret0; 341252#partsFINAL assume true; 341692#partsEXIT >#67#return; 341223#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341444#$Ultimate##0 ~p := #in~p;~q := #in~q; 341695#L20 assume !(~p <= 0); 341221#L21 assume ~q <= 0;#res := 0; 341224#partsFINAL assume true; 341439#partsEXIT >#69#return; 341436#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341417#partsFINAL assume true; 341419#partsEXIT >#69#return; 341412#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341411#partsFINAL assume true; 341406#partsEXIT >#65#return; 341286#L22-2 #res := #t~ret0;havoc #t~ret0; 341283#partsFINAL assume true; 341284#partsEXIT >#71#return; 341267#L36-1 [2024-10-12 00:14:48,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 12 times [2024-10-12 00:14:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:48,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667857691] [2024-10-12 00:14:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:48,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:48,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:48,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash 258544616, now seen corresponding path program 8 times [2024-10-12 00:14:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973029882] [2024-10-12 00:14:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 00:14:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 146 proven. 405 refuted. 0 times theorem prover too weak. 1633 trivial. 0 not checked. [2024-10-12 00:14:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973029882] [2024-10-12 00:14:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973029882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:48,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462316529] [2024-10-12 00:14:48,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:48,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:48,570 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:48,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2024-10-12 00:14:48,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:48,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:48,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:14:48,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 139 proven. 412 refuted. 0 times theorem prover too weak. 1633 trivial. 0 not checked. [2024-10-12 00:14:48,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 139 proven. 418 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2024-10-12 00:14:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462316529] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:49,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 29 [2024-10-12 00:14:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264050914] [2024-10-12 00:14:49,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:49,212 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 00:14:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2024-10-12 00:14:49,213 INFO L87 Difference]: Start difference. First operand 1995 states and 2424 transitions. cyclomatic complexity: 453 Second operand has 30 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 19 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (26), 14 states have call predecessors, (26), 19 states have call successors, (26) [2024-10-12 00:14:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:49,629 INFO L93 Difference]: Finished difference Result 2345 states and 2946 transitions. [2024-10-12 00:14:49,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2345 states and 2946 transitions. [2024-10-12 00:14:49,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-10-12 00:14:49,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2345 states to 2241 states and 2772 transitions. [2024-10-12 00:14:49,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2024-10-12 00:14:49,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2024-10-12 00:14:49,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2241 states and 2772 transitions. [2024-10-12 00:14:49,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:49,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2241 states and 2772 transitions. [2024-10-12 00:14:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states and 2772 transitions. [2024-10-12 00:14:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2057. [2024-10-12 00:14:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1345 states have (on average 1.0721189591078066) internal successors, (1442), 1412 states have internal predecessors, (1442), 429 states have call successors, (436), 233 states have call predecessors, (436), 283 states have return successors, (636), 411 states have call predecessors, (636), 429 states have call successors, (636) [2024-10-12 00:14:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2514 transitions. [2024-10-12 00:14:49,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2057 states and 2514 transitions. [2024-10-12 00:14:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 00:14:49,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 2057 states and 2514 transitions. [2024-10-12 00:14:49,668 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-12 00:14:49,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2057 states and 2514 transitions. [2024-10-12 00:14:49,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:14:49,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:49,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:49,671 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-12 00:14:49,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 35, 20, 17, 17, 17, 17, 17, 17, 15, 7, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1] [2024-10-12 00:14:49,672 INFO L745 eck$LassoCheckResult]: Stem: 347473#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 347427#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; 347428#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; 347425#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; 347426#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 347488#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347630#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347631#$Ultimate##0 ~p := #in~p;~q := #in~q; 347633#L20 assume ~p <= 0;#res := 1; 347632#partsFINAL assume true; 347629#partsEXIT >#71#return; 347628#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347626#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347623#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347624#$Ultimate##0 ~p := #in~p;~q := #in~q; 347627#L20 assume ~p <= 0;#res := 1; 347625#partsFINAL assume true; 347622#partsEXIT >#71#return; 347621#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347618#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347614#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347507#$Ultimate##0 ~p := #in~p;~q := #in~q; 347620#L20 assume ~p <= 0;#res := 1; 347617#partsFINAL assume true; 347613#partsEXIT >#71#return; 347610#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347593#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347505#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347506#$Ultimate##0 ~p := #in~p;~q := #in~q; 347635#L20 assume ~p <= 0;#res := 1; 347634#partsFINAL assume true; 347504#partsEXIT >#71#return; 347503#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347502#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 347448#L35-3 havoc main_~q~0#1; 347445#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 347446#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 347579#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347552#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347553#$Ultimate##0 ~p := #in~p;~q := #in~q; 347584#L20 assume !(~p <= 0); 347574#L21 assume ~q <= 0;#res := 0; 347571#partsFINAL assume true; 347551#partsEXIT >#71#return; 347550#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347548#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347545#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347546#$Ultimate##0 ~p := #in~p;~q := #in~q; 347586#L20 assume !(~p <= 0); 347585#L21 assume !(~q <= 0); 347583#L22 assume !(~q > ~p); 347581#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347582#$Ultimate##0 ~p := #in~p;~q := #in~q; 347603#L20 assume ~p <= 0;#res := 1; 347597#partsFINAL assume true; 347580#partsEXIT >#67#return; 347577#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347578#$Ultimate##0 ~p := #in~p;~q := #in~q; 347596#L20 assume !(~p <= 0); 347595#L21 assume ~q <= 0;#res := 0; 347594#partsFINAL assume true; 347576#partsEXIT >#69#return; 347573#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347570#partsFINAL assume true; 347544#partsEXIT >#71#return; 347537#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347532#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347529#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347497#$Ultimate##0 ~p := #in~p;~q := #in~q; 347566#L20 assume !(~p <= 0); 347564#L21 assume !(~q <= 0); 347563#L22 assume ~q > ~p; 347542#L22-1 call #t~ret0 := parts(~p, ~p);< 347543#$Ultimate##0 ~p := #in~p;~q := #in~q; 347619#L20 assume !(~p <= 0); 347616#L21 assume !(~q <= 0); 347612#L22 assume !(~q > ~p); 347608#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347609#$Ultimate##0 ~p := #in~p;~q := #in~q; 347615#L20 assume ~p <= 0;#res := 1; 347611#partsFINAL assume true; 347607#partsEXIT >#67#return; 347561#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347562#$Ultimate##0 ~p := #in~p;~q := #in~q; 347568#L20 assume !(~p <= 0); 347567#L21 assume ~q <= 0;#res := 0; 347565#partsFINAL assume true; 347560#partsEXIT >#69#return; 347556#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347554#partsFINAL assume true; 347541#partsEXIT >#65#return; 347536#L22-2 #res := #t~ret0;havoc #t~ret0; 347531#partsFINAL assume true; 347528#partsEXIT >#71#return; 347526#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347524#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347496#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347498#$Ultimate##0 ~p := #in~p;~q := #in~q; 347549#L20 assume !(~p <= 0); 347547#L21 assume !(~q <= 0); 347540#L22 assume ~q > ~p; 347534#L22-1 call #t~ret0 := parts(~p, ~p);< 347535#$Ultimate##0 ~p := #in~p;~q := #in~q; 347605#L20 assume !(~p <= 0); 347602#L21 assume !(~q <= 0); 347601#L22 assume !(~q > ~p); 347599#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347600#$Ultimate##0 ~p := #in~p;~q := #in~q; 347606#L20 assume ~p <= 0;#res := 1; 347604#partsFINAL assume true; 347598#partsEXIT >#67#return; 347558#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347559#$Ultimate##0 ~p := #in~p;~q := #in~q; 347575#L20 assume !(~p <= 0); 347572#L21 assume ~q <= 0;#res := 0; 347569#partsFINAL assume true; 347557#partsEXIT >#69#return; 347555#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347539#partsFINAL assume true; 347533#partsEXIT >#65#return; 347530#L22-2 #res := #t~ret0;havoc #t~ret0; 347527#partsFINAL assume true; 347525#partsEXIT >#71#return; 347492#L36-1 [2024-10-12 00:14:49,672 INFO L747 eck$LassoCheckResult]: Loop: 347492#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347491#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 347447#L35-3 havoc main_~q~0#1; 347443#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 347444#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 347474#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347429#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347430#$Ultimate##0 ~p := #in~p;~q := #in~q; 347501#L20 assume !(~p <= 0); 347500#L21 assume ~q <= 0;#res := 0; 347499#partsFINAL assume true; 347493#partsEXIT >#71#return; 347483#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347484#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 348154#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 348155#$Ultimate##0 ~p := #in~p;~q := #in~q; 348205#L20 assume !(~p <= 0); 348199#L21 assume !(~q <= 0); 348197#L22 assume !(~q > ~p); 348194#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348195#$Ultimate##0 ~p := #in~p;~q := #in~q; 348245#L20 assume !(~p <= 0); 348244#L21 assume !(~q <= 0); 348243#L22 assume !(~q > ~p); 348207#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348210#$Ultimate##0 ~p := #in~p;~q := #in~q; 348223#L20 assume !(~p <= 0); 348222#L21 assume !(~q <= 0); 348215#L22 assume !(~q > ~p); 348208#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348210#$Ultimate##0 ~p := #in~p;~q := #in~q; 348223#L20 assume !(~p <= 0); 348222#L21 assume !(~q <= 0); 348215#L22 assume !(~q > ~p); 348216#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348221#$Ultimate##0 ~p := #in~p;~q := #in~q; 348227#L20 assume ~p <= 0;#res := 1; 348225#partsFINAL assume true; 348220#partsEXIT >#67#return; 348218#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348219#$Ultimate##0 ~p := #in~p;~q := #in~q; 348228#L20 assume !(~p <= 0); 348226#L21 assume ~q <= 0;#res := 0; 348224#partsFINAL assume true; 348217#partsEXIT >#69#return; 348214#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348213#partsFINAL assume true; 348209#partsEXIT >#67#return; 348202#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348204#$Ultimate##0 ~p := #in~p;~q := #in~q; 348212#L20 assume !(~p <= 0); 348211#L21 assume ~q <= 0;#res := 0; 348206#partsFINAL assume true; 348200#partsEXIT >#69#return; 348203#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348514#partsFINAL assume true; 348510#partsEXIT >#67#return; 348507#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348508#$Ultimate##0 ~p := #in~p;~q := #in~q; 348512#L20 assume !(~p <= 0); 348511#L21 assume ~q <= 0;#res := 0; 348509#partsFINAL assume true; 348505#partsEXIT >#69#return; 348504#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348502#partsFINAL assume true; 348500#partsEXIT >#67#return; 348497#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348498#$Ultimate##0 ~p := #in~p;~q := #in~q; 348503#L20 assume !(~p <= 0); 348501#L21 assume ~q <= 0;#res := 0; 348499#partsFINAL assume true; 348496#partsEXIT >#69#return; 348494#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348492#partsFINAL assume true; 348490#partsEXIT >#71#return; 348096#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 348095#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347945#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347946#$Ultimate##0 ~p := #in~p;~q := #in~q; 348128#L20 assume !(~p <= 0); 348122#L21 assume !(~q <= 0); 348120#L22 assume !(~q > ~p); 347981#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347982#$Ultimate##0 ~p := #in~p;~q := #in~q; 348018#L20 assume !(~p <= 0); 348016#L21 assume !(~q <= 0); 348012#L22 assume ~q > ~p; 347995#L22-1 call #t~ret0 := parts(~p, ~p);< 347996#$Ultimate##0 ~p := #in~p;~q := #in~q; 348020#L20 assume !(~p <= 0); 348019#L21 assume !(~q <= 0); 348017#L22 assume !(~q > ~p); 348014#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348015#$Ultimate##0 ~p := #in~p;~q := #in~q; 348031#L20 assume ~p <= 0;#res := 1; 348029#partsFINAL assume true; 348013#partsEXIT >#67#return; 348010#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348011#$Ultimate##0 ~p := #in~p;~q := #in~q; 348037#L20 assume !(~p <= 0); 348035#L21 assume ~q <= 0;#res := 0; 348033#partsFINAL assume true; 348009#partsEXIT >#69#return; 348008#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348007#partsFINAL assume true; 347994#partsEXIT >#65#return; 347990#L22-2 #res := #t~ret0;havoc #t~ret0; 347985#partsFINAL assume true; 347978#partsEXIT >#67#return; 347971#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348119#$Ultimate##0 ~p := #in~p;~q := #in~q; 348248#L20 assume !(~p <= 0); 348247#L21 assume !(~q <= 0); 348078#L22 assume !(~q > ~p); 348063#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348072#$Ultimate##0 ~p := #in~p;~q := #in~q; 348395#L20 assume !(~p <= 0); 348393#L21 assume !(~q <= 0); 348328#L22 assume !(~q > ~p); 348269#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348327#$Ultimate##0 ~p := #in~p;~q := #in~q; 348322#L20 assume !(~p <= 0); 348319#L21 assume !(~q <= 0); 348320#L22 assume !(~q > ~p); 348177#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348179#$Ultimate##0 ~p := #in~p;~q := #in~q; 348190#L20 assume ~p <= 0;#res := 1; 348187#partsFINAL assume true; 348175#partsEXIT >#67#return; 348168#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348173#$Ultimate##0 ~p := #in~p;~q := #in~q; 348232#L20 assume !(~p <= 0); 348231#L21 assume ~q <= 0;#res := 0; 348185#partsFINAL assume true; 348167#partsEXIT >#69#return; 348171#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348286#partsFINAL assume true; 348284#partsEXIT >#67#return; 348281#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348282#$Ultimate##0 ~p := #in~p;~q := #in~q; 348287#L20 assume !(~p <= 0); 348285#L21 assume ~q <= 0;#res := 0; 348283#partsFINAL assume true; 348278#partsEXIT >#69#return; 348104#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348105#partsFINAL assume true; 348061#partsEXIT >#67#return; 348050#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348058#$Ultimate##0 ~p := #in~p;~q := #in~q; 348074#L20 assume !(~p <= 0); 348073#L21 assume ~q <= 0;#res := 0; 348059#partsFINAL assume true; 348046#partsEXIT >#69#return; 348045#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348044#partsFINAL assume true; 347969#partsEXIT >#69#return; 347973#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348075#partsFINAL assume true; 348076#partsEXIT >#71#return; 347638#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347636#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347518#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347521#$Ultimate##0 ~p := #in~p;~q := #in~q; 348149#L20 assume !(~p <= 0); 348147#L21 assume !(~q <= 0); 348139#L22 assume !(~q > ~p); 347980#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347982#$Ultimate##0 ~p := #in~p;~q := #in~q; 348018#L20 assume !(~p <= 0); 348016#L21 assume !(~q <= 0); 348012#L22 assume ~q > ~p; 347995#L22-1 call #t~ret0 := parts(~p, ~p);< 347996#$Ultimate##0 ~p := #in~p;~q := #in~q; 348020#L20 assume !(~p <= 0); 348019#L21 assume !(~q <= 0); 348017#L22 assume !(~q > ~p); 348014#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348015#$Ultimate##0 ~p := #in~p;~q := #in~q; 348031#L20 assume ~p <= 0;#res := 1; 348029#partsFINAL assume true; 348013#partsEXIT >#67#return; 348010#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348011#$Ultimate##0 ~p := #in~p;~q := #in~q; 348037#L20 assume !(~p <= 0); 348035#L21 assume ~q <= 0;#res := 0; 348033#partsFINAL assume true; 348009#partsEXIT >#69#return; 348008#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348007#partsFINAL assume true; 347994#partsEXIT >#65#return; 347990#L22-2 #res := #t~ret0;havoc #t~ret0; 347985#partsFINAL assume true; 347978#partsEXIT >#67#return; 347972#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347974#$Ultimate##0 ~p := #in~p;~q := #in~q; 348087#L20 assume !(~p <= 0); 348079#L21 assume !(~q <= 0); 348080#L22 assume !(~q > ~p); 348067#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348072#$Ultimate##0 ~p := #in~p;~q := #in~q; 348395#L20 assume !(~p <= 0); 348393#L21 assume !(~q <= 0); 348328#L22 assume !(~q > ~p); 348269#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348327#$Ultimate##0 ~p := #in~p;~q := #in~q; 348322#L20 assume !(~p <= 0); 348319#L21 assume !(~q <= 0); 348320#L22 assume !(~q > ~p); 348177#L23 call #t~ret1 := parts(~p - ~q, ~q);< 348179#$Ultimate##0 ~p := #in~p;~q := #in~q; 348190#L20 assume ~p <= 0;#res := 1; 348187#partsFINAL assume true; 348175#partsEXIT >#67#return; 348168#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348173#$Ultimate##0 ~p := #in~p;~q := #in~q; 348232#L20 assume !(~p <= 0); 348231#L21 assume ~q <= 0;#res := 0; 348185#partsFINAL assume true; 348167#partsEXIT >#69#return; 348171#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348286#partsFINAL assume true; 348284#partsEXIT >#67#return; 348281#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348282#$Ultimate##0 ~p := #in~p;~q := #in~q; 348287#L20 assume !(~p <= 0); 348285#L21 assume ~q <= 0;#res := 0; 348283#partsFINAL assume true; 348278#partsEXIT >#69#return; 348104#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348105#partsFINAL assume true; 348061#partsEXIT >#67#return; 348071#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 348136#$Ultimate##0 ~p := #in~p;~q := #in~q; 348291#L20 assume !(~p <= 0); 348289#L21 assume ~q <= 0;#res := 0; 348274#partsFINAL assume true; 348277#partsEXIT >#69#return; 348130#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348091#partsFINAL assume true; 348092#partsEXIT >#69#return; 348088#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 348089#partsFINAL assume true; 347936#partsEXIT >#71#return; 347519#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 347965#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 347517#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 347522#$Ultimate##0 ~p := #in~p;~q := #in~q; 347671#L20 assume !(~p <= 0); 347647#L21 assume !(~q <= 0); 347648#L22 assume ~q > ~p; 347641#L22-1 call #t~ret0 := parts(~p, ~p);< 347643#$Ultimate##0 ~p := #in~p;~q := #in~q; 347669#L20 assume !(~p <= 0); 347667#L21 assume !(~q <= 0); 347663#L22 assume !(~q > ~p); 347655#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347659#$Ultimate##0 ~p := #in~p;~q := #in~q; 347665#L20 assume ~p <= 0;#res := 1; 347661#partsFINAL assume true; 347654#partsEXIT >#67#return; 347650#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347651#$Ultimate##0 ~p := #in~p;~q := #in~q; 347759#L20 assume !(~p <= 0); 347757#L21 assume !(~q <= 0); 347755#L22 assume !(~q > ~p); 347713#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347714#$Ultimate##0 ~p := #in~p;~q := #in~q; 347866#L20 assume !(~p <= 0); 347862#L21 assume !(~q <= 0); 347762#L22 assume !(~q > ~p); 347741#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347744#$Ultimate##0 ~p := #in~p;~q := #in~q; 347750#L20 assume ~p <= 0;#res := 1; 347748#partsFINAL assume true; 347740#partsEXIT >#67#return; 347725#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347730#$Ultimate##0 ~p := #in~p;~q := #in~q; 347754#L20 assume !(~p <= 0); 347753#L21 assume ~q <= 0;#res := 0; 347734#partsFINAL assume true; 347724#partsEXIT >#69#return; 347721#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347718#partsFINAL assume true; 347712#partsEXIT >#67#return; 347675#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347708#$Ultimate##0 ~p := #in~p;~q := #in~q; 347722#L20 assume !(~p <= 0); 347719#L21 assume ~q <= 0;#res := 0; 347707#partsFINAL assume true; 347674#partsEXIT >#69#return; 347673#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347672#partsFINAL assume true; 347649#partsEXIT >#69#return; 347646#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347644#partsFINAL assume true; 347639#partsEXIT >#65#return; 347642#L22-2 #res := #t~ret0;havoc #t~ret0; 348077#partsFINAL assume true; 348040#partsEXIT >#71#return; 347492#L36-1 [2024-10-12 00:14:49,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 13 times [2024-10-12 00:14:49,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:49,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567835748] [2024-10-12 00:14:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:49,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:49,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:49,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1407293637, now seen corresponding path program 9 times [2024-10-12 00:14:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262969300] [2024-10-12 00:14:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:49,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:49,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 00:14:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 00:14:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 00:14:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-12 00:14:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 187 proven. 1022 refuted. 0 times theorem prover too weak. 3469 trivial. 0 not checked. [2024-10-12 00:14:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262969300] [2024-10-12 00:14:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262969300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691284798] [2024-10-12 00:14:50,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:50,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:50,193 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:50,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2024-10-12 00:14:50,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-12 00:14:50,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:50,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:14:50,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 850 proven. 130 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2024-10-12 00:14:50,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 858 proven. 131 refuted. 0 times theorem prover too weak. 3689 trivial. 0 not checked. [2024-10-12 00:14:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691284798] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:51,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 16] total 40 [2024-10-12 00:14:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587716536] [2024-10-12 00:14:51,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:51,202 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 00:14:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 00:14:51,203 INFO L87 Difference]: Start difference. First operand 2057 states and 2514 transitions. cyclomatic complexity: 481 Second operand has 40 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 35 states have internal predecessors, (99), 25 states have call successors, (33), 1 states have call predecessors, (33), 13 states have return successors, (37), 27 states have call predecessors, (37), 25 states have call successors, (37) [2024-10-12 00:14:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:53,001 INFO L93 Difference]: Finished difference Result 2639 states and 3142 transitions. [2024-10-12 00:14:53,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2639 states and 3142 transitions. [2024-10-12 00:14:53,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-12 00:14:53,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2639 states to 948 states and 1042 transitions. [2024-10-12 00:14:53,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2024-10-12 00:14:53,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2024-10-12 00:14:53,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 948 states and 1042 transitions. [2024-10-12 00:14:53,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:53,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 948 states and 1042 transitions. [2024-10-12 00:14:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states and 1042 transitions. [2024-10-12 00:14:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 836. [2024-10-12 00:14:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 589 states have (on average 1.0305602716468591) internal successors, (607), 598 states have internal predecessors, (607), 133 states have call successors, (140), 109 states have call predecessors, (140), 114 states have return successors, (152), 128 states have call predecessors, (152), 133 states have call successors, (152) [2024-10-12 00:14:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 899 transitions. [2024-10-12 00:14:53,023 INFO L240 hiAutomatonCegarLoop]: Abstraction has 836 states and 899 transitions. [2024-10-12 00:14:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-10-12 00:14:53,024 INFO L425 stractBuchiCegarLoop]: Abstraction has 836 states and 899 transitions. [2024-10-12 00:14:53,024 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-10-12 00:14:53,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 836 states and 899 transitions. [2024-10-12 00:14:53,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-12 00:14:53,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:53,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:53,027 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-12 00:14:53,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 38, 24, 19, 19, 19, 19, 19, 19, 14, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2024-10-12 00:14:53,027 INFO L745 eck$LassoCheckResult]: Stem: 354986#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 354956#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; 354957#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; 354950#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; 354951#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 355000#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355052#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355053#$Ultimate##0 ~p := #in~p;~q := #in~q; 355055#L20 assume ~p <= 0;#res := 1; 355054#partsFINAL assume true; 355051#partsEXIT >#71#return; 355050#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355048#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355045#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355046#$Ultimate##0 ~p := #in~p;~q := #in~q; 355049#L20 assume ~p <= 0;#res := 1; 355047#partsFINAL assume true; 355044#partsEXIT >#71#return; 355043#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355041#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355039#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355034#$Ultimate##0 ~p := #in~p;~q := #in~q; 355042#L20 assume ~p <= 0;#res := 1; 355040#partsFINAL assume true; 355038#partsEXIT >#71#return; 355036#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355035#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355008#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355033#$Ultimate##0 ~p := #in~p;~q := #in~q; 355029#L20 assume ~p <= 0;#res := 1; 355030#partsFINAL assume true; 355007#partsEXIT >#71#return; 355009#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355003#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 355004#L35-3 havoc main_~q~0#1; 354968#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 354969#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 355170#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355155#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355156#$Ultimate##0 ~p := #in~p;~q := #in~q; 355167#L20 assume !(~p <= 0); 355165#L21 assume ~q <= 0;#res := 0; 355163#partsFINAL assume true; 355154#partsEXIT >#71#return; 355149#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355146#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355142#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355143#$Ultimate##0 ~p := #in~p;~q := #in~q; 355168#L20 assume !(~p <= 0); 355166#L21 assume !(~q <= 0); 355164#L22 assume !(~q > ~p); 355161#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355162#$Ultimate##0 ~p := #in~p;~q := #in~q; 355171#L20 assume ~p <= 0;#res := 1; 355169#partsFINAL assume true; 355160#partsEXIT >#67#return; 355152#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355153#$Ultimate##0 ~p := #in~p;~q := #in~q; 355159#L20 assume !(~p <= 0); 355158#L21 assume ~q <= 0;#res := 0; 355157#partsFINAL assume true; 355151#partsEXIT >#69#return; 355148#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355145#partsFINAL assume true; 355141#partsEXIT >#71#return; 355136#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355137#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355398#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355390#$Ultimate##0 ~p := #in~p;~q := #in~q; 355411#L20 assume !(~p <= 0); 355407#L21 assume !(~q <= 0); 355405#L22 assume ~q > ~p; 355402#L22-1 call #t~ret0 := parts(~p, ~p);< 355403#$Ultimate##0 ~p := #in~p;~q := #in~q; 355422#L20 assume !(~p <= 0); 355420#L21 assume !(~q <= 0); 355418#L22 assume !(~q > ~p); 355414#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355415#$Ultimate##0 ~p := #in~p;~q := #in~q; 355421#L20 assume ~p <= 0;#res := 1; 355417#partsFINAL assume true; 355413#partsEXIT >#67#return; 355409#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355410#$Ultimate##0 ~p := #in~p;~q := #in~q; 355419#L20 assume !(~p <= 0); 355416#L21 assume ~q <= 0;#res := 0; 355412#partsFINAL assume true; 355408#partsEXIT >#69#return; 355406#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355404#partsFINAL assume true; 355401#partsEXIT >#65#return; 355400#L22-2 #res := #t~ret0;havoc #t~ret0; 355399#partsFINAL assume true; 355397#partsEXIT >#71#return; 355392#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355391#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355020#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355388#$Ultimate##0 ~p := #in~p;~q := #in~q; 355386#L20 assume !(~p <= 0); 355384#L21 assume !(~q <= 0); 355383#L22 assume ~q > ~p; 355344#L22-1 call #t~ret0 := parts(~p, ~p);< 355378#$Ultimate##0 ~p := #in~p;~q := #in~q; 355360#L20 assume !(~p <= 0); 355354#L21 assume !(~q <= 0); 355353#L22 assume !(~q > ~p); 355351#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355352#$Ultimate##0 ~p := #in~p;~q := #in~q; 355364#L20 assume ~p <= 0;#res := 1; 355363#partsFINAL assume true; 355350#partsEXIT >#67#return; 355320#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355339#$Ultimate##0 ~p := #in~p;~q := #in~q; 355333#L20 assume !(~p <= 0); 355329#L21 assume ~q <= 0;#res := 0; 355319#partsFINAL assume true; 355321#partsEXIT >#69#return; 355475#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355480#partsFINAL assume true; 355479#partsEXIT >#65#return; 355478#L22-2 #res := #t~ret0;havoc #t~ret0; 355476#partsFINAL assume true; 355019#partsEXIT >#71#return; 355018#L36-1 [2024-10-12 00:14:53,028 INFO L747 eck$LassoCheckResult]: Loop: 355018#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 354993#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 354972#L35-3 havoc main_~q~0#1; 354966#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 354967#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 355013#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 354952#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 354953#$Ultimate##0 ~p := #in~p;~q := #in~q; 355026#L20 assume !(~p <= 0); 355025#L21 assume ~q <= 0;#res := 0; 355024#partsFINAL assume true; 355023#partsEXIT >#71#return; 354997#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 354994#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 354995#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355491#$Ultimate##0 ~p := #in~p;~q := #in~q; 355722#L20 assume !(~p <= 0); 355701#L21 assume !(~q <= 0); 355700#L22 assume !(~q > ~p); 355615#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355616#$Ultimate##0 ~p := #in~p;~q := #in~q; 355721#L20 assume !(~p <= 0); 355716#L21 assume !(~q <= 0); 355715#L22 assume !(~q > ~p); 355628#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355629#$Ultimate##0 ~p := #in~p;~q := #in~q; 355645#L20 assume !(~p <= 0); 355644#L21 assume !(~q <= 0); 355643#L22 assume !(~q > ~p); 355640#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355641#$Ultimate##0 ~p := #in~p;~q := #in~q; 355647#L20 assume ~p <= 0;#res := 1; 355646#partsFINAL assume true; 355639#partsEXIT >#67#return; 355636#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355637#$Ultimate##0 ~p := #in~p;~q := #in~q; 355650#L20 assume !(~p <= 0); 355649#L21 assume ~q <= 0;#res := 0; 355648#partsFINAL assume true; 355635#partsEXIT >#69#return; 355633#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355632#partsFINAL assume true; 355627#partsEXIT >#67#return; 355624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355625#$Ultimate##0 ~p := #in~p;~q := #in~q; 355642#L20 assume !(~p <= 0); 355638#L21 assume ~q <= 0;#res := 0; 355634#partsFINAL assume true; 355623#partsEXIT >#69#return; 355621#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355620#partsFINAL assume true; 355614#partsEXIT >#67#return; 355611#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355612#$Ultimate##0 ~p := #in~p;~q := #in~q; 355630#L20 assume !(~p <= 0); 355626#L21 assume ~q <= 0;#res := 0; 355622#partsFINAL assume true; 355610#partsEXIT >#69#return; 355608#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355607#partsFINAL assume true; 355490#partsEXIT >#71#return; 354998#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 354999#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 355525#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 354955#$Ultimate##0 ~p := #in~p;~q := #in~q; 355594#L20 assume !(~p <= 0); 355593#L21 assume !(~q <= 0); 355586#L22 assume !(~q > ~p); 355579#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355580#$Ultimate##0 ~p := #in~p;~q := #in~q; 355666#L20 assume !(~p <= 0); 355664#L21 assume !(~q <= 0); 355663#L22 assume ~q > ~p; 355661#L22-1 call #t~ret0 := parts(~p, ~p);< 355662#$Ultimate##0 ~p := #in~p;~q := #in~q; 355677#L20 assume !(~p <= 0); 355675#L21 assume !(~q <= 0); 355674#L22 assume !(~q > ~p); 355672#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355673#$Ultimate##0 ~p := #in~p;~q := #in~q; 355678#L20 assume ~p <= 0;#res := 1; 355676#partsFINAL assume true; 355671#partsEXIT >#67#return; 355669#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355670#$Ultimate##0 ~p := #in~p;~q := #in~q; 355682#L20 assume !(~p <= 0); 355680#L21 assume ~q <= 0;#res := 0; 355679#partsFINAL assume true; 355668#partsEXIT >#69#return; 355667#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355665#partsFINAL assume true; 355660#partsEXIT >#65#return; 355657#L22-2 #res := #t~ret0;havoc #t~ret0; 355654#partsFINAL assume true; 355578#partsEXIT >#67#return; 355543#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355576#$Ultimate##0 ~p := #in~p;~q := #in~q; 355709#L20 assume !(~p <= 0); 355707#L21 assume !(~q <= 0); 355705#L22 assume !(~q > ~p); 355536#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355540#$Ultimate##0 ~p := #in~p;~q := #in~q; 355617#L20 assume !(~p <= 0); 355613#L21 assume !(~q <= 0); 355605#L22 assume !(~q > ~p); 355598#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355600#$Ultimate##0 ~p := #in~p;~q := #in~q; 355651#L20 assume ~p <= 0;#res := 1; 355603#partsFINAL assume true; 355597#partsEXIT >#67#return; 355582#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355585#$Ultimate##0 ~p := #in~p;~q := #in~q; 355653#L20 assume !(~p <= 0); 355652#L21 assume ~q <= 0;#res := 0; 355595#partsFINAL assume true; 355581#partsEXIT >#69#return; 355577#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355541#partsFINAL assume true; 355533#partsEXIT >#67#return; 355539#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355659#$Ultimate##0 ~p := #in~p;~q := #in~q; 355699#L20 assume !(~p <= 0); 355698#L21 assume ~q <= 0;#res := 0; 355681#partsFINAL assume true; 355658#partsEXIT >#69#return; 355656#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355655#partsFINAL assume true; 355574#partsEXIT >#69#return; 355572#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355571#partsFINAL assume true; 355524#partsEXIT >#71#return; 355518#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355515#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 354954#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 354955#$Ultimate##0 ~p := #in~p;~q := #in~q; 355594#L20 assume !(~p <= 0); 355593#L21 assume !(~q <= 0); 355586#L22 assume !(~q > ~p); 355547#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355551#$Ultimate##0 ~p := #in~p;~q := #in~q; 355631#L20 assume ~p <= 0;#res := 1; 355573#partsFINAL assume true; 355546#partsEXIT >#67#return; 355550#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354949#$Ultimate##0 ~p := #in~p;~q := #in~q; 355766#L20 assume !(~p <= 0); 355764#L21 assume !(~q <= 0); 355763#L22 assume !(~q > ~p); 354936#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355745#$Ultimate##0 ~p := #in~p;~q := #in~q; 355744#L20 assume !(~p <= 0); 355742#L21 assume !(~q <= 0); 355489#L22 assume ~q > ~p; 355485#L22-1 call #t~ret0 := parts(~p, ~p);< 355729#$Ultimate##0 ~p := #in~p;~q := #in~q; 355743#L20 assume !(~p <= 0); 355741#L21 assume !(~q <= 0); 355739#L22 assume !(~q > ~p); 355735#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355736#$Ultimate##0 ~p := #in~p;~q := #in~q; 355746#L20 assume ~p <= 0;#res := 1; 355738#partsFINAL assume true; 355734#partsEXIT >#67#return; 355731#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355732#$Ultimate##0 ~p := #in~p;~q := #in~q; 355740#L20 assume !(~p <= 0); 355737#L21 assume ~q <= 0;#res := 0; 355733#partsFINAL assume true; 355730#partsEXIT >#69#return; 355710#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355711#partsFINAL assume true; 355484#partsEXIT >#65#return; 355486#L22-2 #res := #t~ret0;havoc #t~ret0; 355767#partsFINAL assume true; 354935#partsEXIT >#67#return; 354942#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355688#$Ultimate##0 ~p := #in~p;~q := #in~q; 355686#L20 assume !(~p <= 0); 355685#L21 assume !(~q <= 0); 355684#L22 assume !(~q > ~p); 354938#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355745#$Ultimate##0 ~p := #in~p;~q := #in~q; 355744#L20 assume !(~p <= 0); 355742#L21 assume !(~q <= 0); 355489#L22 assume ~q > ~p; 355485#L22-1 call #t~ret0 := parts(~p, ~p);< 355729#$Ultimate##0 ~p := #in~p;~q := #in~q; 355743#L20 assume !(~p <= 0); 355741#L21 assume !(~q <= 0); 355739#L22 assume !(~q > ~p); 355735#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355736#$Ultimate##0 ~p := #in~p;~q := #in~q; 355746#L20 assume ~p <= 0;#res := 1; 355738#partsFINAL assume true; 355734#partsEXIT >#67#return; 355731#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355732#$Ultimate##0 ~p := #in~p;~q := #in~q; 355740#L20 assume !(~p <= 0); 355737#L21 assume ~q <= 0;#res := 0; 355733#partsFINAL assume true; 355730#partsEXIT >#69#return; 355710#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355711#partsFINAL assume true; 355484#partsEXIT >#65#return; 355486#L22-2 #res := #t~ret0;havoc #t~ret0; 355767#partsFINAL assume true; 354935#partsEXIT >#67#return; 354941#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355688#$Ultimate##0 ~p := #in~p;~q := #in~q; 355686#L20 assume !(~p <= 0); 355685#L21 assume !(~q <= 0); 355684#L22 assume !(~q > ~p); 355534#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355540#$Ultimate##0 ~p := #in~p;~q := #in~q; 355617#L20 assume !(~p <= 0); 355613#L21 assume !(~q <= 0); 355605#L22 assume !(~q > ~p); 355598#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355600#$Ultimate##0 ~p := #in~p;~q := #in~q; 355651#L20 assume ~p <= 0;#res := 1; 355603#partsFINAL assume true; 355597#partsEXIT >#67#return; 355582#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355585#$Ultimate##0 ~p := #in~p;~q := #in~q; 355653#L20 assume !(~p <= 0); 355652#L21 assume ~q <= 0;#res := 0; 355595#partsFINAL assume true; 355581#partsEXIT >#69#return; 355577#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355541#partsFINAL assume true; 355533#partsEXIT >#67#return; 355538#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355659#$Ultimate##0 ~p := #in~p;~q := #in~q; 355699#L20 assume !(~p <= 0); 355698#L21 assume ~q <= 0;#res := 0; 355681#partsFINAL assume true; 355658#partsEXIT >#69#return; 354984#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 354985#partsFINAL assume true; 354996#partsEXIT >#69#return; 354984#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 354985#partsFINAL assume true; 354996#partsEXIT >#69#return; 355760#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355759#partsFINAL assume true; 355755#partsEXIT >#69#return; 355751#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355747#partsFINAL assume true; 355725#partsEXIT >#71#return; 355472#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 355473#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 354988#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 355483#$Ultimate##0 ~p := #in~p;~q := #in~q; 355482#L20 assume !(~p <= 0); 355481#L21 assume !(~q <= 0); 355304#L22 assume ~q > ~p; 355305#L22-1 call #t~ret0 := parts(~p, ~p);< 355456#$Ultimate##0 ~p := #in~p;~q := #in~q; 355451#L20 assume !(~p <= 0); 355423#L21 assume !(~q <= 0); 355396#L22 assume !(~q > ~p); 355323#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355324#$Ultimate##0 ~p := #in~p;~q := #in~q; 355326#L20 assume ~p <= 0;#res := 1; 355325#partsFINAL assume true; 355322#partsEXIT >#67#return; 355315#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355318#$Ultimate##0 ~p := #in~p;~q := #in~q; 355461#L20 assume !(~p <= 0); 355460#L21 assume !(~q <= 0); 355459#L22 assume !(~q > ~p); 355425#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355426#$Ultimate##0 ~p := #in~p;~q := #in~q; 355439#L20 assume !(~p <= 0); 355435#L21 assume !(~q <= 0); 355433#L22 assume ~q > ~p; 355430#L22-1 call #t~ret0 := parts(~p, ~p);< 355431#$Ultimate##0 ~p := #in~p;~q := #in~q; 355450#L20 assume !(~p <= 0); 355448#L21 assume !(~q <= 0); 355446#L22 assume !(~q > ~p); 355442#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355443#$Ultimate##0 ~p := #in~p;~q := #in~q; 355449#L20 assume ~p <= 0;#res := 1; 355445#partsFINAL assume true; 355441#partsEXIT >#67#return; 355437#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355438#$Ultimate##0 ~p := #in~p;~q := #in~q; 355447#L20 assume !(~p <= 0); 355444#L21 assume ~q <= 0;#res := 0; 355440#partsFINAL assume true; 355436#partsEXIT >#69#return; 355434#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355432#partsFINAL assume true; 355429#partsEXIT >#65#return; 355428#L22-2 #res := #t~ret0;havoc #t~ret0; 355427#partsFINAL assume true; 355424#partsEXIT >#67#return; 354944#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355381#$Ultimate##0 ~p := #in~p;~q := #in~q; 355379#L20 assume !(~p <= 0); 355361#L21 assume !(~q <= 0); 355347#L22 assume !(~q > ~p); 355336#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355342#$Ultimate##0 ~p := #in~p;~q := #in~q; 355389#L20 assume !(~p <= 0); 355387#L21 assume !(~q <= 0); 355376#L22 assume !(~q > ~p); 355370#L23 call #t~ret1 := parts(~p - ~q, ~q);< 355371#$Ultimate##0 ~p := #in~p;~q := #in~q; 355374#L20 assume ~p <= 0;#res := 1; 355373#partsFINAL assume true; 355368#partsEXIT >#67#return; 355356#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 355359#$Ultimate##0 ~p := #in~p;~q := #in~q; 355372#L20 assume !(~p <= 0); 355367#L21 assume ~q <= 0;#res := 0; 355365#partsFINAL assume true; 355355#partsEXIT >#69#return; 355346#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355341#partsFINAL assume true; 355335#partsEXIT >#67#return; 354933#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354946#$Ultimate##0 ~p := #in~p;~q := #in~q; 354978#L20 assume !(~p <= 0); 354975#L21 assume ~q <= 0;#res := 0; 354976#partsFINAL assume true; 354932#partsEXIT >#69#return; 354934#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 354983#partsFINAL assume true; 355458#partsEXIT >#69#return; 355457#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355452#partsFINAL assume true; 355314#partsEXIT >#69#return; 355316#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 355507#partsFINAL assume true; 355306#partsEXIT >#65#return; 354987#L22-2 #res := #t~ret0;havoc #t~ret0; 354989#partsFINAL assume true; 355474#partsEXIT >#71#return; 355018#L36-1 [2024-10-12 00:14:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 14 times [2024-10-12 00:14:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614398684] [2024-10-12 00:14:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:53,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:53,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1454852149, now seen corresponding path program 10 times [2024-10-12 00:14:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355903007] [2024-10-12 00:14:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 00:14:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 00:14:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-12 00:14:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 281 proven. 1484 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2024-10-12 00:14:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:53,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355903007] [2024-10-12 00:14:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355903007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86681070] [2024-10-12 00:14:53,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:53,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:53,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:53,612 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:53,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2024-10-12 00:14:53,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:53,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:53,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 00:14:53,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 3107 proven. 253 refuted. 0 times theorem prover too weak. 2699 trivial. 0 not checked. [2024-10-12 00:14:53,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 214 proven. 1351 refuted. 0 times theorem prover too weak. 4494 trivial. 0 not checked. [2024-10-12 00:14:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86681070] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:54,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 22] total 41 [2024-10-12 00:14:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377608106] [2024-10-12 00:14:54,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:54,845 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 00:14:54,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 00:14:54,846 INFO L87 Difference]: Start difference. First operand 836 states and 899 transitions. cyclomatic complexity: 72 Second operand has 41 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 27 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (45), 21 states have call predecessors, (45), 27 states have call successors, (45) [2024-10-12 00:14:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:56,005 INFO L93 Difference]: Finished difference Result 918 states and 991 transitions. [2024-10-12 00:14:56,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 918 states and 991 transitions. [2024-10-12 00:14:56,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-12 00:14:56,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 918 states to 850 states and 895 transitions. [2024-10-12 00:14:56,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2024-10-12 00:14:56,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2024-10-12 00:14:56,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 895 transitions. [2024-10-12 00:14:56,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:56,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 895 transitions. [2024-10-12 00:14:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 895 transitions. [2024-10-12 00:14:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 839. [2024-10-12 00:14:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 597 states have (on average 1.018425460636516) internal successors, (608), 602 states have internal predecessors, (608), 127 states have call successors, (134), 112 states have call predecessors, (134), 115 states have return successors, (141), 124 states have call predecessors, (141), 127 states have call successors, (141) [2024-10-12 00:14:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 883 transitions. [2024-10-12 00:14:56,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 839 states and 883 transitions. [2024-10-12 00:14:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-12 00:14:56,014 INFO L425 stractBuchiCegarLoop]: Abstraction has 839 states and 883 transitions. [2024-10-12 00:14:56,014 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-10-12 00:14:56,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 839 states and 883 transitions. [2024-10-12 00:14:56,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-12 00:14:56,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:56,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:56,016 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-12 00:14:56,016 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-12 00:14:56,017 INFO L745 eck$LassoCheckResult]: Stem: 360022#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 359981#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; 359982#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; 359979#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; 359980#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 360036#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360084#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360085#$Ultimate##0 ~p := #in~p;~q := #in~q; 360087#L20 assume ~p <= 0;#res := 1; 360086#partsFINAL assume true; 360083#partsEXIT >#71#return; 360082#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360080#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360077#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360078#$Ultimate##0 ~p := #in~p;~q := #in~q; 360081#L20 assume ~p <= 0;#res := 1; 360079#partsFINAL assume true; 360076#partsEXIT >#71#return; 360075#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360073#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360071#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360067#$Ultimate##0 ~p := #in~p;~q := #in~q; 360074#L20 assume ~p <= 0;#res := 1; 360072#partsFINAL assume true; 360070#partsEXIT >#71#return; 360069#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360068#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360054#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360066#$Ultimate##0 ~p := #in~p;~q := #in~q; 360062#L20 assume ~p <= 0;#res := 1; 360063#partsFINAL assume true; 360053#partsEXIT >#71#return; 360051#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360052#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 359995#L35-3 havoc main_~q~0#1; 359996#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 360037#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 360038#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360178#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360179#$Ultimate##0 ~p := #in~p;~q := #in~q; 360188#L20 assume !(~p <= 0); 360187#L21 assume ~q <= 0;#res := 0; 360185#partsFINAL assume true; 360177#partsEXIT >#71#return; 360173#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360131#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360126#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360127#$Ultimate##0 ~p := #in~p;~q := #in~q; 360327#L20 assume !(~p <= 0); 360326#L21 assume !(~q <= 0); 360324#L22 assume !(~q > ~p); 360321#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360322#$Ultimate##0 ~p := #in~p;~q := #in~q; 360325#L20 assume ~p <= 0;#res := 1; 360323#partsFINAL assume true; 360320#partsEXIT >#67#return; 360152#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360153#$Ultimate##0 ~p := #in~p;~q := #in~q; 360158#L20 assume !(~p <= 0); 360157#L21 assume ~q <= 0;#res := 0; 360156#partsFINAL assume true; 360151#partsEXIT >#69#return; 360149#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360148#partsFINAL assume true; 360125#partsEXIT >#71#return; 360122#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360123#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360399#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360393#$Ultimate##0 ~p := #in~p;~q := #in~q; 360424#L20 assume !(~p <= 0); 360415#L21 assume !(~q <= 0); 360410#L22 assume ~q > ~p; 360406#L22-1 call #t~ret0 := parts(~p, ~p);< 360407#$Ultimate##0 ~p := #in~p;~q := #in~q; 360441#L20 assume !(~p <= 0); 360440#L21 assume !(~q <= 0); 360437#L22 assume !(~q > ~p); 360432#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360433#$Ultimate##0 ~p := #in~p;~q := #in~q; 360439#L20 assume ~p <= 0;#res := 1; 360436#partsFINAL assume true; 360431#partsEXIT >#67#return; 360421#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360422#$Ultimate##0 ~p := #in~p;~q := #in~q; 360434#L20 assume !(~p <= 0); 360430#L21 assume ~q <= 0;#res := 0; 360429#partsFINAL assume true; 360420#partsEXIT >#69#return; 360414#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360409#partsFINAL assume true; 360405#partsEXIT >#65#return; 360403#L22-2 #res := #t~ret0;havoc #t~ret0; 360401#partsFINAL assume true; 360398#partsEXIT >#71#return; 360396#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360394#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360345#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360392#$Ultimate##0 ~p := #in~p;~q := #in~q; 360391#L20 assume !(~p <= 0); 360390#L21 assume !(~q <= 0); 360389#L22 assume ~q > ~p; 360344#L22-1 call #t~ret0 := parts(~p, ~p);< 360346#$Ultimate##0 ~p := #in~p;~q := #in~q; 360438#L20 assume !(~p <= 0); 360435#L21 assume !(~q <= 0); 360423#L22 assume !(~q > ~p); 360418#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360419#$Ultimate##0 ~p := #in~p;~q := #in~q; 360428#L20 assume ~p <= 0;#res := 1; 360427#partsFINAL assume true; 360417#partsEXIT >#67#return; 360412#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360413#$Ultimate##0 ~p := #in~p;~q := #in~q; 360426#L20 assume !(~p <= 0); 360425#L21 assume ~q <= 0;#res := 0; 360416#partsFINAL assume true; 360411#partsEXIT >#69#return; 360408#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360404#partsFINAL assume true; 360402#partsEXIT >#65#return; 360400#L22-2 #res := #t~ret0;havoc #t~ret0; 360397#partsFINAL assume true; 360395#partsEXIT >#71#return; 360040#L36-1 [2024-10-12 00:14:56,017 INFO L747 eck$LassoCheckResult]: Loop: 360040#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360039#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 359994#L35-3 havoc main_~q~0#1; 359990#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 359991#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 360023#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 359983#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 359984#$Ultimate##0 ~p := #in~p;~q := #in~q; 360048#L20 assume !(~p <= 0); 360047#L21 assume ~q <= 0;#res := 0; 360046#partsFINAL assume true; 360041#partsEXIT >#71#return; 360030#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360031#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360386#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360387#$Ultimate##0 ~p := #in~p;~q := #in~q; 360583#L20 assume !(~p <= 0); 360581#L21 assume !(~q <= 0); 360579#L22 assume !(~q > ~p); 360576#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360577#$Ultimate##0 ~p := #in~p;~q := #in~q; 360606#L20 assume !(~p <= 0); 360601#L21 assume !(~q <= 0); 360595#L22 assume !(~q > ~p); 360592#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360593#$Ultimate##0 ~p := #in~p;~q := #in~q; 360658#L20 assume !(~p <= 0); 360656#L21 assume !(~q <= 0); 360655#L22 assume !(~q > ~p); 360653#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360654#$Ultimate##0 ~p := #in~p;~q := #in~q; 360659#L20 assume ~p <= 0;#res := 1; 360657#partsFINAL assume true; 360652#partsEXIT >#67#return; 360650#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360651#$Ultimate##0 ~p := #in~p;~q := #in~q; 360664#L20 assume !(~p <= 0); 360662#L21 assume ~q <= 0;#res := 0; 360660#partsFINAL assume true; 360649#partsEXIT >#69#return; 360648#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360647#partsFINAL assume true; 360591#partsEXIT >#67#return; 360588#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360589#$Ultimate##0 ~p := #in~p;~q := #in~q; 360665#L20 assume !(~p <= 0); 360663#L21 assume ~q <= 0;#res := 0; 360661#partsFINAL assume true; 360587#partsEXIT >#69#return; 360586#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360585#partsFINAL assume true; 360575#partsEXIT >#67#return; 360446#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360574#$Ultimate##0 ~p := #in~p;~q := #in~q; 360744#L20 assume !(~p <= 0); 360742#L21 assume ~q <= 0;#res := 0; 360741#partsFINAL assume true; 360445#partsEXIT >#69#return; 360447#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360573#partsFINAL assume true; 360572#partsEXIT >#71#return; 360571#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360570#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360385#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360564#$Ultimate##0 ~p := #in~p;~q := #in~q; 360562#L20 assume !(~p <= 0); 360555#L21 assume !(~q <= 0); 360551#L22 assume !(~q > ~p); 360510#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360511#$Ultimate##0 ~p := #in~p;~q := #in~q; 360677#L20 assume !(~p <= 0); 360673#L21 assume !(~q <= 0); 360672#L22 assume ~q > ~p; 360669#L22-1 call #t~ret0 := parts(~p, ~p);< 360670#$Ultimate##0 ~p := #in~p;~q := #in~q; 360698#L20 assume !(~p <= 0); 360696#L21 assume !(~q <= 0); 360695#L22 assume !(~q > ~p); 360692#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360693#$Ultimate##0 ~p := #in~p;~q := #in~q; 360700#L20 assume ~p <= 0;#res := 1; 360699#partsFINAL assume true; 360691#partsEXIT >#67#return; 360688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360689#$Ultimate##0 ~p := #in~p;~q := #in~q; 360703#L20 assume !(~p <= 0); 360702#L21 assume ~q <= 0;#res := 0; 360701#partsFINAL assume true; 360687#partsEXIT >#69#return; 360685#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360684#partsFINAL assume true; 360668#partsEXIT >#65#return; 360666#L22-2 #res := #t~ret0;havoc #t~ret0; 360549#partsFINAL assume true; 360508#partsEXIT >#67#return; 360448#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360449#$Ultimate##0 ~p := #in~p;~q := #in~q; 360715#L20 assume !(~p <= 0); 360713#L21 assume !(~q <= 0); 360712#L22 assume !(~q > ~p); 360637#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360641#$Ultimate##0 ~p := #in~p;~q := #in~q; 360640#L20 assume !(~p <= 0); 360639#L21 assume !(~q <= 0); 360638#L22 assume !(~q > ~p); 360626#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360635#$Ultimate##0 ~p := #in~p;~q := #in~q; 360633#L20 assume !(~p <= 0); 360631#L21 assume !(~q <= 0); 360630#L22 assume !(~q > ~p); 360628#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360629#$Ultimate##0 ~p := #in~p;~q := #in~q; 360634#L20 assume ~p <= 0;#res := 1; 360632#partsFINAL assume true; 360627#partsEXIT >#67#return; 360008#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360007#$Ultimate##0 ~p := #in~p;~q := #in~q; 360009#L20 assume !(~p <= 0); 360035#L21 assume ~q <= 0;#res := 0; 360625#partsFINAL assume true; 360616#partsEXIT >#69#return; 360617#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360721#partsFINAL assume true; 360720#partsEXIT >#67#return; 360718#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360719#$Ultimate##0 ~p := #in~p;~q := #in~q; 360724#L20 assume !(~p <= 0); 360723#L21 assume ~q <= 0;#res := 0; 360722#partsFINAL assume true; 360717#partsEXIT >#69#return; 360716#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360714#partsFINAL assume true; 360711#partsEXIT >#67#return; 360708#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360710#$Ultimate##0 ~p := #in~p;~q := #in~q; 360730#L20 assume !(~p <= 0); 360728#L21 assume ~q <= 0;#res := 0; 360725#partsFINAL assume true; 360706#partsEXIT >#69#return; 360705#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360704#partsFINAL assume true; 360503#partsEXIT >#69#return; 360443#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360388#partsFINAL assume true; 360384#partsEXIT >#71#return; 360032#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360033#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 359985#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 359986#$Ultimate##0 ~p := #in~p;~q := #in~q; 360787#L20 assume !(~p <= 0); 360786#L21 assume !(~q <= 0); 360743#L22 assume !(~q > ~p); 360557#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360561#$Ultimate##0 ~p := #in~p;~q := #in~q; 360584#L20 assume ~p <= 0;#res := 1; 360578#partsFINAL assume true; 360556#partsEXIT >#67#return; 360559#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360740#$Ultimate##0 ~p := #in~p;~q := #in~q; 360760#L20 assume !(~p <= 0); 360758#L21 assume !(~q <= 0); 360757#L22 assume !(~q > ~p); 360608#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360756#$Ultimate##0 ~p := #in~p;~q := #in~q; 360774#L20 assume !(~p <= 0); 360772#L21 assume !(~q <= 0); 360768#L22 assume ~q > ~p; 359977#L22-1 call #t~ret0 := parts(~p, ~p);< 360767#$Ultimate##0 ~p := #in~p;~q := #in~q; 360802#L20 assume !(~p <= 0); 360002#L21 assume !(~q <= 0); 360000#L22 assume !(~q > ~p); 359973#L23 call #t~ret1 := parts(~p - ~q, ~q);< 359989#$Ultimate##0 ~p := #in~p;~q := #in~q; 360801#L20 assume ~p <= 0;#res := 1; 360800#partsFINAL assume true; 359972#partsEXIT >#67#return; 359974#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 359978#$Ultimate##0 ~p := #in~p;~q := #in~q; 360784#L20 assume !(~p <= 0); 360783#L21 assume ~q <= 0;#res := 0; 360781#partsFINAL assume true; 360780#partsEXIT >#69#return; 360779#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360778#partsFINAL assume true; 360766#partsEXIT >#65#return; 360764#L22-2 #res := #t~ret0;havoc #t~ret0; 360759#partsFINAL assume true; 360754#partsEXIT >#67#return; 360643#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360731#$Ultimate##0 ~p := #in~p;~q := #in~q; 360729#L20 assume !(~p <= 0); 360727#L21 assume !(~q <= 0); 360726#L22 assume !(~q > ~p); 360636#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360641#$Ultimate##0 ~p := #in~p;~q := #in~q; 360640#L20 assume !(~p <= 0); 360639#L21 assume !(~q <= 0); 360638#L22 assume !(~q > ~p); 360626#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360635#$Ultimate##0 ~p := #in~p;~q := #in~q; 360633#L20 assume !(~p <= 0); 360631#L21 assume !(~q <= 0); 360630#L22 assume !(~q > ~p); 360628#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360629#$Ultimate##0 ~p := #in~p;~q := #in~q; 360634#L20 assume ~p <= 0;#res := 1; 360632#partsFINAL assume true; 360627#partsEXIT >#67#return; 360008#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360007#$Ultimate##0 ~p := #in~p;~q := #in~q; 360009#L20 assume !(~p <= 0); 360035#L21 assume ~q <= 0;#res := 0; 360625#partsFINAL assume true; 360616#partsEXIT >#69#return; 360617#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360721#partsFINAL assume true; 360720#partsEXIT >#67#return; 360718#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360719#$Ultimate##0 ~p := #in~p;~q := #in~q; 360724#L20 assume !(~p <= 0); 360723#L21 assume ~q <= 0;#res := 0; 360722#partsFINAL assume true; 360717#partsEXIT >#69#return; 360716#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360714#partsFINAL assume true; 360711#partsEXIT >#67#return; 360707#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360710#$Ultimate##0 ~p := #in~p;~q := #in~q; 360730#L20 assume !(~p <= 0); 360728#L21 assume ~q <= 0;#res := 0; 360725#partsFINAL assume true; 360706#partsEXIT >#69#return; 360709#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360782#partsFINAL assume true; 360752#partsEXIT >#69#return; 360750#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360747#partsFINAL assume true; 360739#partsEXIT >#69#return; 360737#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360735#partsFINAL assume true; 360733#partsEXIT >#71#return; 360341#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 360339#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 360043#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 360045#$Ultimate##0 ~p := #in~p;~q := #in~q; 360522#L20 assume !(~p <= 0); 360521#L21 assume !(~q <= 0); 360520#L22 assume ~q > ~p; 360370#L22-1 call #t~ret0 := parts(~p, ~p);< 360382#$Ultimate##0 ~p := #in~p;~q := #in~q; 360379#L20 assume !(~p <= 0); 360378#L21 assume !(~q <= 0); 360377#L22 assume !(~q > ~p); 360374#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360375#$Ultimate##0 ~p := #in~p;~q := #in~q; 360383#L20 assume ~p <= 0;#res := 1; 360381#partsFINAL assume true; 360373#partsEXIT >#67#return; 360361#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360368#$Ultimate##0 ~p := #in~p;~q := #in~q; 360367#L20 assume !(~p <= 0); 360365#L21 assume !(~q <= 0); 360363#L22 assume !(~q > ~p); 360018#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360356#$Ultimate##0 ~p := #in~p;~q := #in~q; 360352#L20 assume !(~p <= 0); 360350#L21 assume !(~q <= 0); 360348#L22 assume ~q > ~p; 360017#L22-1 call #t~ret0 := parts(~p, ~p);< 360019#$Ultimate##0 ~p := #in~p;~q := #in~q; 360366#L20 assume !(~p <= 0); 360364#L21 assume !(~q <= 0); 360362#L22 assume !(~q > ~p); 360359#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360360#$Ultimate##0 ~p := #in~p;~q := #in~q; 360380#L20 assume ~p <= 0;#res := 1; 360372#partsFINAL assume true; 360358#partsEXIT >#67#return; 360354#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360355#$Ultimate##0 ~p := #in~p;~q := #in~q; 360376#L20 assume !(~p <= 0); 360371#L21 assume ~q <= 0;#res := 0; 360357#partsFINAL assume true; 360353#partsEXIT >#69#return; 360351#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360349#partsFINAL assume true; 360347#partsEXIT >#65#return; 360025#L22-2 #res := #t~ret0;havoc #t~ret0; 360026#partsFINAL assume true; 360516#partsEXIT >#67#return; 359987#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360468#$Ultimate##0 ~p := #in~p;~q := #in~q; 360569#L20 assume !(~p <= 0); 360568#L21 assume !(~q <= 0); 360567#L22 assume !(~q > ~p); 359975#L23 call #t~ret1 := parts(~p - ~q, ~q);< 359988#$Ultimate##0 ~p := #in~p;~q := #in~q; 360544#L20 assume !(~p <= 0); 360543#L21 assume !(~q <= 0); 360542#L22 assume !(~q > ~p); 360531#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360540#$Ultimate##0 ~p := #in~p;~q := #in~q; 360538#L20 assume !(~p <= 0); 360537#L21 assume !(~q <= 0); 360536#L22 assume !(~q > ~p); 360534#L23 call #t~ret1 := parts(~p - ~q, ~q);< 360535#$Ultimate##0 ~p := #in~p;~q := #in~q; 360541#L20 assume ~p <= 0;#res := 1; 360539#partsFINAL assume true; 360533#partsEXIT >#67#return; 360006#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360003#$Ultimate##0 ~p := #in~p;~q := #in~q; 360005#L20 assume !(~p <= 0); 360034#L21 assume ~q <= 0;#res := 0; 360530#partsFINAL assume true; 360525#partsEXIT >#69#return; 360526#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360792#partsFINAL assume true; 360791#partsEXIT >#67#return; 359970#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 359976#$Ultimate##0 ~p := #in~p;~q := #in~q; 360805#L20 assume !(~p <= 0); 360799#L21 assume ~q <= 0;#res := 0; 360028#partsFINAL assume true; 359969#partsEXIT >#69#return; 359971#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360011#partsFINAL assume true; 360794#partsEXIT >#67#return; 360493#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 360494#$Ultimate##0 ~p := #in~p;~q := #in~q; 360804#L20 assume !(~p <= 0); 360803#L21 assume ~q <= 0;#res := 0; 360793#partsFINAL assume true; 360492#partsEXIT >#69#return; 360490#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360488#partsFINAL assume true; 360467#partsEXIT >#69#return; 360461#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360456#partsFINAL assume true; 360452#partsEXIT >#69#return; 360453#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 360798#partsFINAL assume true; 360517#partsEXIT >#65#return; 360515#L22-2 #res := #t~ret0;havoc #t~ret0; 360512#partsFINAL assume true; 360481#partsEXIT >#71#return; 360040#L36-1 [2024-10-12 00:14:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -662684889, now seen corresponding path program 15 times [2024-10-12 00:14:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039516977] [2024-10-12 00:14:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:56,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:56,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:56,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash -193613692, now seen corresponding path program 11 times [2024-10-12 00:14:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:56,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140557060] [2024-10-12 00:14:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:56,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:56,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:56,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -874340962, now seen corresponding path program 16 times [2024-10-12 00:14:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735083730] [2024-10-12 00:14:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:14:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 00:14:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 00:14:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 00:14:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 00:14:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 00:14:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-12 00:14:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-12 00:14:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 00:14:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-10-12 00:14:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:14:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10945 backedges. 343 proven. 835 refuted. 0 times theorem prover too weak. 9767 trivial. 0 not checked. [2024-10-12 00:14:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735083730] [2024-10-12 00:14:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735083730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679770348] [2024-10-12 00:14:56,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:56,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:56,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:56,525 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:56,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2024-10-12 00:14:56,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:56,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:56,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:14:56,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10945 backedges. 5302 proven. 139 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2024-10-12 00:14:56,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10945 backedges. 348 proven. 829 refuted. 0 times theorem prover too weak. 9768 trivial. 0 not checked. [2024-10-12 00:14:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679770348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:57,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 13] total 24 [2024-10-12 00:14:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22157453] [2024-10-12 00:14:57,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:59,649 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:59,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:59,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:59,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:59,649 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:59,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:59,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:59,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:59,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2024-10-12 00:14:59,649 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:59,649 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:59,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:59,678 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:59,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:59,680 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:59,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-10-12 00:14:59,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:59,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:59,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-10-12 00:14:59,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:59,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:59,710 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:59,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-10-12 00:14:59,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:59,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:59,723 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:59,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-10-12 00:14:59,734 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:59,734 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:59,734 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:59,734 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:59,734 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:59,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:59,734 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:59,734 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:59,734 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2024-10-12 00:14:59,734 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:59,734 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:59,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:59,763 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:59,763 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:59,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:59,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:59,764 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:59,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-10-12 00:14:59,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:59,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:59,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:59,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:59,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:59,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:59,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:59,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:59,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:59,779 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:59,779 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:59,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:59,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:59,780 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:59,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-10-12 00:14:59,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:59,781 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:59,781 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:59,781 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 5 Supporting invariants [] [2024-10-12 00:14:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:59,792 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:59,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:59,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:14:59,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:00,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 2239 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-12 00:15:00,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 36 proven. 878 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2024-10-12 00:15:00,929 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2024-10-12 00:15:00,929 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 839 states and 883 transitions. cyclomatic complexity: 51 Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-12 00:15:01,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 839 states and 883 transitions. cyclomatic complexity: 51. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Result 1667 states and 1758 transitions. Complement of second has 99 states. [2024-10-12 00:15:01,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2024-10-12 00:15:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-12 00:15:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 82 transitions. [2024-10-12 00:15:01,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 82 transitions. Stem has 123 letters. Loop has 347 letters. [2024-10-12 00:15:01,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:01,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 82 transitions. Stem has 470 letters. Loop has 347 letters. [2024-10-12 00:15:01,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:01,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 82 transitions. Stem has 123 letters. Loop has 694 letters. [2024-10-12 00:15:01,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:01,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1667 states and 1758 transitions. [2024-10-12 00:15:01,297 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:15:01,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1667 states to 0 states and 0 transitions. [2024-10-12 00:15:01,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:15:01,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:15:01,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:15:01,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:15:01,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:15:01,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:15:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 00:15:01,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2024-10-12 00:15:01,300 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 24 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 states have internal predecessors, (81), 18 states have call successors, (26), 2 states have call predecessors, (26), 6 states have return successors, (28), 13 states have call predecessors, (28), 18 states have call successors, (28) [2024-10-12 00:15:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:01,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-12 00:15:01,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-12 00:15:01,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:15:01,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 00:15:01,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:15:01,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:15:01,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:15:01,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:15:01,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:15:01,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:15:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:15:01,301 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:15:01,301 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-10-12 00:15:01,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:15:01,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:15:01,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:15:01,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:15:01 BoogieIcfgContainer [2024-10-12 00:15:01,307 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:15:01,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:15:01,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:15:01,308 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:15:01,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:13:59" (3/4) ... [2024-10-12 00:15:01,310 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:15:01,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:15:01,311 INFO L158 Benchmark]: Toolchain (without parser) took 62653.49ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 97.8MB in the beginning and 829.0MB in the end (delta: -731.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-12 00:15:01,312 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 65.3MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:15:01,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.16ms. Allocated memory is still 163.6MB. Free memory was 97.7MB in the beginning and 133.0MB in the end (delta: -35.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:15:01,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.25ms. Allocated memory is still 163.6MB. Free memory was 133.0MB in the beginning and 131.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:15:01,312 INFO L158 Benchmark]: Boogie Preprocessor took 20.16ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 130.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:15:01,312 INFO L158 Benchmark]: RCFGBuilder took 222.55ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 119.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:15:01,313 INFO L158 Benchmark]: BuchiAutomizer took 62163.27ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.2MB in the beginning and 829.0MB in the end (delta: -709.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-12 00:15:01,313 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 2.0GB. Free memory is still 829.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:15:01,314 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 65.3MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.16ms. Allocated memory is still 163.6MB. Free memory was 97.7MB in the beginning and 133.0MB in the end (delta: -35.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.25ms. Allocated memory is still 163.6MB. Free memory was 133.0MB in the beginning and 131.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.16ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 130.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 222.55ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 119.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 62163.27ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.2MB in the beginning and 829.0MB in the end (delta: -709.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 2.0GB. Free memory is still 829.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 42 terminating modules (27 trivial, 10 deterministic, 5 nondeterministic). One deterministic module has affine ranking function ((long) -1 * p) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * p) + 1) and consists of 8 locations. One deterministic module has affine ranking function (((long) -2 * q) + 1) and consists of 8 locations. One deterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. One deterministic module has affine ranking function \old(q) and consists of 7 locations. One deterministic module has affine ranking function \old(p) and consists of 7 locations. One deterministic module has affine ranking function \old(q) and consists of 10 locations. One deterministic module has affine ranking function (((long) -2 * p) + 1) and consists of 14 locations. One deterministic module has affine ranking function (3 + ((long) -2 * p)) and consists of 17 locations. One deterministic module has affine ranking function (5 + ((long) -2 * p)) and consists of 19 locations. One nondeterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 11 locations. One nondeterministic module has affine ranking function \old(q) and consists of 8 locations. 27 modules have a trivial ranking function, the largest among these consists of 41 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.1s and 30 iterations. TraceHistogramMax:49. Analysis of lassos took 38.2s. Construction of modules took 5.2s. Büchi inclusion checks took 16.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 38. Automata minimization 2.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 13457 StatesRemovedByMinimization, 39 NontrivialMinimizations. Non-live state removal took 2.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [10, 0, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6459/7638 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2266 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2179 mSDsluCounter, 6162 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4610 mSDsCounter, 1683 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11660 IncrementalHoareTripleChecker+Invalid, 13343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1683 mSolverCounterUnsat, 1552 mSDtfsCounter, 11660 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT6 SILN0 SILU0 SILI5 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf91 smp97 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 15 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 12.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:15:01,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-10-12 00:15:01,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2024-10-12 00:15:01,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2024-10-12 00:15:01,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2024-10-12 00:15:02,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2024-10-12 00:15:02,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2024-10-12 00:15:02,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:02,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2024-10-12 00:15:02,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2024-10-12 00:15:03,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2024-10-12 00:15:03,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2024-10-12 00:15:03,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:03,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2024-10-12 00:15:03,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2024-10-12 00:15:04,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:04,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2024-10-12 00:15:04,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2024-10-12 00:15:04,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2024-10-12 00:15:04,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2024-10-12 00:15:05,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2024-10-12 00:15:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:05,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2024-10-12 00:15:05,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-10-12 00:15:05,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-10-12 00:15:06,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:06,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:06,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE