./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/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:57:18,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:57:18,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:57:18,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:57:18,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:57:18,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:57:18,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:57:18,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:57:18,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:57:18,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:57:18,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:57:18,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:57:18,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:57:18,184 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:57:18,185 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:57:18,186 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:57:18,186 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:57:18,186 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:57:18,186 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:57:18,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:57:18,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:57:18,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:57:18,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:57:18,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:57:18,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:57:18,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:57:18,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:57:18,193 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:57:18,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:57:18,193 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:57:18,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:57:18,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:57:18,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:57:18,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:57:18,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:57:18,194 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:57:18,194 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2024-10-13 16:57:18,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:57:18,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:57:18,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:57:18,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:57:18,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:57:18,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-10-13 16:57:19,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:57:19,888 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:57:19,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-10-13 16:57:19,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c656516/99d6c6a0527f4c98af8a62d28c2021ae/FLAG5ffae3e31 [2024-10-13 16:57:20,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c656516/99d6c6a0527f4c98af8a62d28c2021ae [2024-10-13 16:57:20,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:57:20,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:57:20,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:20,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:57:20,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:57:20,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26deb8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20, skipping insertion in model container [2024-10-13 16:57:20,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:57:20,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:20,490 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:57:20,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:20,514 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:57:20,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20 WrapperNode [2024-10-13 16:57:20,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:20,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:20,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:57:20,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:57:20,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,549 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-10-13 16:57:20,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:20,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:57:20,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:57:20,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:57:20,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,567 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:57:20,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:57:20,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:57:20,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:57:20,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:57:20,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (1/1) ... [2024-10-13 16:57:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:20,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:20,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 16:57:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2024-10-13 16:57:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2024-10-13 16:57:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:57:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:57:20,712 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:57:20,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:57:20,829 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 16:57:20,829 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:57:20,839 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:57:20,839 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 16:57:20,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:20 BoogieIcfgContainer [2024-10-13 16:57:20,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:57:20,840 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:57:20,840 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:57:20,844 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:57:20,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:20,844 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:57:20" (1/3) ... [2024-10-13 16:57:20,845 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4411eb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:20, skipping insertion in model container [2024-10-13 16:57:20,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:20,845 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:20" (2/3) ... [2024-10-13 16:57:20,846 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4411eb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:20, skipping insertion in model container [2024-10-13 16:57:20,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:20,846 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:20" (3/3) ... [2024-10-13 16:57:20,847 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2024-10-13 16:57:20,889 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:57:20,889 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:57:20,889 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:57:20,890 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:57:20,890 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:57:20,890 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:57:20,890 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:57:20,890 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:57:20,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:57:20,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-10-13 16:57:20,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:20,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:20,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:20,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:20,913 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:57:20,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:57:20,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-10-13 16:57:20,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:20,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:20,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:20,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:20,921 INFO L745 eck$LassoCheckResult]: Stem: 27#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15#L35true assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28#L38true assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 11#L41-3true [2024-10-13 16:57:20,922 INFO L747 eck$LassoCheckResult]: Loop: 11#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 30#L42-4true havoc main_~k~0#1; 13#L41-2true main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11#L41-3true [2024-10-13 16:57:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2024-10-13 16:57:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589610706] [2024-10-13 16:57:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:21,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:21,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1792233, now seen corresponding path program 1 times [2024-10-13 16:57:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150204334] [2024-10-13 16:57:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:21,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:21,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:21,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash -15995056, now seen corresponding path program 1 times [2024-10-13 16:57:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736534757] [2024-10-13 16:57:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:21,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736534757] [2024-10-13 16:57:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736534757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:21,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:57:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302091678] [2024-10-13 16:57:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:21,223 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:21,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:21,224 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:21,224 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:21,225 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:21,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:21,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:21,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-10-13 16:57:21,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:21,225 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:21,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:21,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:21,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:21,308 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:21,309 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:21,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 16:57:21,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:21,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:21,333 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:21,333 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:21,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 16:57:21,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 16:57:21,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:21,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:21,359 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:21,359 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post10#1=0} Honda state: {ULTIMATE.start_main_#t~post10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:21,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:21,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 16:57:21,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:21,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:21,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 16:57:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 16:57:21,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:21,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:21,477 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:21,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:21,483 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:21,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:21,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:21,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:21,483 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:21,483 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,483 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:21,483 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:21,483 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-10-13 16:57:21,483 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:21,483 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:21,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:21,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:21,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:21,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:21,528 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 16:57:21,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:21,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:21,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:21,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:21,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:21,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:21,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:21,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:21,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:21,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 16:57:21,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 16:57:21,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:21,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:21,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:21,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:21,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:21,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:21,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:21,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:21,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:21,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:21,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 16:57:21,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:21,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:21,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:21,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:21,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:21,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:21,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:21,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:21,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:21,618 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 16:57:21,618 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-13 16:57:21,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:21,638 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:21,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 16:57:21,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:21,640 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:21,640 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:21,640 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-10-13 16:57:21,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 16:57:21,654 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:21,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:21,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:21,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:21,697 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:21,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:21,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 16:57:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:21,827 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 16:57:21,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:21,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7). 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 74 states and 107 transitions. Complement of second has 11 states. [2024-10-13 16:57:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2024-10-13 16:57:21,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-13 16:57:21,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:21,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-13 16:57:21,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:21,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 8 letters. [2024-10-13 16:57:21,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:21,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 107 transitions. [2024-10-13 16:57:21,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-10-13 16:57:21,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 35 states and 50 transitions. [2024-10-13 16:57:21,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-13 16:57:21,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-13 16:57:21,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2024-10-13 16:57:21,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:21,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-13 16:57:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2024-10-13 16:57:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-10-13 16:57:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:57:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-10-13 16:57:22,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-10-13 16:57:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:22,012 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:22,066 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-13 16:57:22,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2024-10-13 16:57:22,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-13 16:57:22,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2024-10-13 16:57:22,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-13 16:57:22,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-13 16:57:22,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-10-13 16:57:22,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:57:22,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-13 16:57:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-10-13 16:57:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-13 16:57:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:57:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-13 16:57:22,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-13 16:57:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:22,073 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-13 16:57:22,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:57:22,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-10-13 16:57:22,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-13 16:57:22,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:22,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:22,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:22,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:22,076 INFO L745 eck$LassoCheckResult]: Stem: 252#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 241#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 247#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 243#L41-3 [2024-10-13 16:57:22,076 INFO L747 eck$LassoCheckResult]: Loop: 243#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 227#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 228#$Ultimate##0 ~n := #in~n; 250#L25 assume ~n <= 0;#res := 1; 239#factFINAL assume true; 229#factEXIT >#78#return; 232#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 228#$Ultimate##0 ~n := #in~n; 250#L25 assume ~n <= 0;#res := 1; 239#factFINAL assume true; 229#factEXIT >#80#return; 234#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 228#$Ultimate##0 ~n := #in~n; 250#L25 assume ~n <= 0;#res := 1; 239#factFINAL assume true; 229#factEXIT >#82#return; 238#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 242#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 248#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 251#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 253#L42-4 havoc main_~k~0#1; 246#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 243#L41-3 [2024-10-13 16:57:22,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2024-10-13 16:57:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248846955] [2024-10-13 16:57:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:22,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2022384732, now seen corresponding path program 1 times [2024-10-13 16:57:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:22,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989710026] [2024-10-13 16:57:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 16:57:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 16:57:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:57:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989710026] [2024-10-13 16:57:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989710026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:57:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765756161] [2024-10-13 16:57:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:22,295 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 16:57:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 16:57:22,296 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:57:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:22,357 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2024-10-13 16:57:22,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2024-10-13 16:57:22,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-13 16:57:22,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 43 transitions. [2024-10-13 16:57:22,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-13 16:57:22,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-13 16:57:22,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2024-10-13 16:57:22,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:57:22,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-10-13 16:57:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2024-10-13 16:57:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 16:57:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-13 16:57:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2024-10-13 16:57:22,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-10-13 16:57:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 16:57:22,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-10-13 16:57:22,365 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:57:22,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2024-10-13 16:57:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-13 16:57:22,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:22,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:22,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:22,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:22,366 INFO L745 eck$LassoCheckResult]: Stem: 330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 317#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 324#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 320#L41-3 [2024-10-13 16:57:22,367 INFO L747 eck$LassoCheckResult]: Loop: 320#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 321#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 326#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 310#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 304#$Ultimate##0 ~n := #in~n; 327#L25 assume ~n <= 0;#res := 1; 328#factFINAL assume true; 305#factEXIT >#72#return; 306#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 304#$Ultimate##0 ~n := #in~n; 327#L25 assume ~n <= 0;#res := 1; 328#factFINAL assume true; 305#factEXIT >#74#return; 308#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 304#$Ultimate##0 ~n := #in~n; 327#L25 assume ~n <= 0;#res := 1; 328#factFINAL assume true; 305#factEXIT >#76#return; 312#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 322#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 325#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 329#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 331#L42-4 havoc main_~k~0#1; 323#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 320#L41-3 [2024-10-13 16:57:22,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2024-10-13 16:57:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:22,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983016226] [2024-10-13 16:57:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:22,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash -481826528, now seen corresponding path program 1 times [2024-10-13 16:57:22,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:22,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787227560] [2024-10-13 16:57:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806473800] [2024-10-13 16:57:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:22,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,386 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 16:57:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1147386361, now seen corresponding path program 1 times [2024-10-13 16:57:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088453699] [2024-10-13 16:57:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848801068] [2024-10-13 16:57:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:22,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,466 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 16:57:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:22,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:22,734 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:22,734 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:22,734 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:22,734 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:22,734 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:22,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,735 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:22,735 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:22,735 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-10-13 16:57:22,735 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:22,735 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:22,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,813 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:22,813 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:22,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 16:57:22,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:22,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:22,829 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:22,830 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:22,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:22,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,844 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 16:57:22,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:22,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:22,856 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:22,858 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:22,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,870 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 16:57:22,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:22,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:22,883 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:22,883 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:22,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:22,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,896 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 16:57:22,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:22,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:22,910 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:22,910 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:22,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:22,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,922 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 16:57:22,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:22,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:22,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:22,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:22,949 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:22,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 16:57:22,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:22,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:22,964 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:22,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:22,978 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:22,978 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:22,978 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:22,978 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:22,978 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:22,978 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:22,978 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:22,978 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:22,978 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-10-13 16:57:22,978 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:22,978 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:22,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:22,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:23,119 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:23,120 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:23,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,122 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 16:57:23,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:23,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:23,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:23,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:23,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:23,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:23,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:23,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:23,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:23,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-13 16:57:23,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,158 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 16:57:23,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:23,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:23,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:23,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:23,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:23,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:23,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:23,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:23,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:23,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 16:57:23,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,184 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 16:57:23,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:23,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:23,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:23,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:23,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:23,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:23,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:23,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:23,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:23,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:23,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,214 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 16:57:23,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:23,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:23,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:23,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:23,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:23,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:23,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:23,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:23,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:23,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-13 16:57:23,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,243 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:23,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 16:57:23,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:23,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:23,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:23,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:23,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:23,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:23,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:23,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:23,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:23,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,273 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 16:57:23,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:23,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:23,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:23,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:23,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:23,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:23,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:23,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:23,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:23,291 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:23,291 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:23,293 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:23,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 16:57:23,295 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:23,295 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:23,295 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:23,295 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2024-10-13 16:57:23,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:23,307 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:23,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:57:23,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:57:23,495 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-10-13 16:57:23,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:23,734 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Result 119 states and 178 transitions. Complement of second has 28 states. [2024-10-13 16:57:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-10-13 16:57:23,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 24 letters. [2024-10-13 16:57:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 28 letters. Loop has 24 letters. [2024-10-13 16:57:23,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:23,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 48 letters. [2024-10-13 16:57:23,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:23,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 178 transitions. [2024-10-13 16:57:23,745 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-13 16:57:23,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 176 transitions. [2024-10-13 16:57:23,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-13 16:57:23,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-13 16:57:23,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 176 transitions. [2024-10-13 16:57:23,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:23,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 176 transitions. [2024-10-13 16:57:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 176 transitions. [2024-10-13 16:57:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-10-13 16:57:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 30 states have call successors, (30), 6 states have call predecessors, (30), 10 states have return successors, (50), 30 states have call predecessors, (50), 30 states have call successors, (50) [2024-10-13 16:57:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-13 16:57:23,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-13 16:57:23,766 INFO L425 stractBuchiCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-13 16:57:23,766 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:57:23,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 167 transitions. [2024-10-13 16:57:23,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-13 16:57:23,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:23,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:23,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:23,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:23,771 INFO L745 eck$LassoCheckResult]: Stem: 659#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 622#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 623#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 639#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 660#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 631#L42-3 [2024-10-13 16:57:23,771 INFO L747 eck$LassoCheckResult]: Loop: 631#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 642#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 643#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 674#$Ultimate##0 ~n := #in~n; 680#L25 assume !(~n <= 0); 611#L26 call #t~ret0 := fact(~n - 1);< 628#$Ultimate##0 ~n := #in~n; 649#L25 assume ~n <= 0;#res := 1; 609#factFINAL assume true; 613#factEXIT >#70#return; 678#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 676#factFINAL assume true; 669#factEXIT >#72#return; 672#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 674#$Ultimate##0 ~n := #in~n; 680#L25 assume ~n <= 0;#res := 1; 681#factFINAL assume true; 675#factEXIT >#74#return; 670#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 674#$Ultimate##0 ~n := #in~n; 680#L25 assume ~n <= 0;#res := 1; 681#factFINAL assume true; 675#factEXIT >#76#return; 668#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 666#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 664#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 663#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 661#L42-4 havoc main_~k~0#1; 637#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 630#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 631#L42-3 [2024-10-13 16:57:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2024-10-13 16:57:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:23,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274011818] [2024-10-13 16:57:23,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:23,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:23,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1586780350, now seen corresponding path program 1 times [2024-10-13 16:57:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918105538] [2024-10-13 16:57:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 16:57:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918105538] [2024-10-13 16:57:23,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918105538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:23,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:23,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:57:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038165613] [2024-10-13 16:57:23,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:23,871 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:57:23,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:57:23,871 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. cyclomatic complexity: 60 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:57:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:23,943 INFO L93 Difference]: Finished difference Result 157 states and 236 transitions. [2024-10-13 16:57:23,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 236 transitions. [2024-10-13 16:57:23,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 51 [2024-10-13 16:57:23,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 148 states and 227 transitions. [2024-10-13 16:57:23,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-10-13 16:57:23,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-10-13 16:57:23,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 227 transitions. [2024-10-13 16:57:23,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:23,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 227 transitions. [2024-10-13 16:57:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 227 transitions. [2024-10-13 16:57:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2024-10-13 16:57:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 79 states have internal predecessors, (91), 30 states have call successors, (30), 6 states have call predecessors, (30), 10 states have return successors, (50), 30 states have call predecessors, (50), 30 states have call successors, (50) [2024-10-13 16:57:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2024-10-13 16:57:23,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-13 16:57:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:57:23,970 INFO L425 stractBuchiCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-13 16:57:23,970 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:57:23,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 171 transitions. [2024-10-13 16:57:23,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2024-10-13 16:57:23,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:23,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:23,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:23,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:23,972 INFO L745 eck$LassoCheckResult]: Stem: 956#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 924#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 925#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 943#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 957#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 933#L42-3 [2024-10-13 16:57:23,972 INFO L747 eck$LassoCheckResult]: Loop: 933#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 962#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 968#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 974#$Ultimate##0 ~n := #in~n; 978#L25 assume !(~n <= 0); 895#L26 call #t~ret0 := fact(~n - 1);< 930#$Ultimate##0 ~n := #in~n; 951#L25 assume ~n <= 0;#res := 1; 948#factFINAL assume true; 893#factEXIT >#70#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975#factFINAL assume true; 967#factEXIT >#72#return; 969#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 974#$Ultimate##0 ~n := #in~n; 978#L25 assume ~n <= 0;#res := 1; 977#factFINAL assume true; 976#factEXIT >#74#return; 972#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 974#$Ultimate##0 ~n := #in~n; 978#L25 assume ~n <= 0;#res := 1; 977#factFINAL assume true; 976#factEXIT >#76#return; 936#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 937#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 980#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 933#L42-3 [2024-10-13 16:57:23,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:23,973 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2024-10-13 16:57:23,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:23,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683007628] [2024-10-13 16:57:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:23,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:23,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:23,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:23,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -542592342, now seen corresponding path program 1 times [2024-10-13 16:57:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642567407] [2024-10-13 16:57:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 16:57:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642567407] [2024-10-13 16:57:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642567407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944375307] [2024-10-13 16:57:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:24,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:24,133 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:24,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-13 16:57:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:57:24,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 16:57:24,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:24,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 16:57:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944375307] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:24,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-13 16:57:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181083715] [2024-10-13 16:57:24,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:24,382 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 16:57:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-13 16:57:24,383 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. cyclomatic complexity: 60 Second operand has 13 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 16:57:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:24,591 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2024-10-13 16:57:24,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 261 transitions. [2024-10-13 16:57:24,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2024-10-13 16:57:24,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 261 transitions. [2024-10-13 16:57:24,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-10-13 16:57:24,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-10-13 16:57:24,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 261 transitions. [2024-10-13 16:57:24,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:24,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 261 transitions. [2024-10-13 16:57:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 261 transitions. [2024-10-13 16:57:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 130. [2024-10-13 16:57:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 83 states have internal predecessors, (99), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (58), 36 states have call predecessors, (58), 36 states have call successors, (58) [2024-10-13 16:57:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-13 16:57:24,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-13 16:57:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 16:57:24,606 INFO L425 stractBuchiCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-13 16:57:24,606 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 16:57:24,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 193 transitions. [2024-10-13 16:57:24,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2024-10-13 16:57:24,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:24,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:24,608 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:57:24,608 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:24,608 INFO L745 eck$LassoCheckResult]: Stem: 1438#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1402#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1403#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1420#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1439#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1411#L42-3 [2024-10-13 16:57:24,608 INFO L747 eck$LassoCheckResult]: Loop: 1411#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1447#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1452#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1462#$Ultimate##0 ~n := #in~n; 1476#L25 assume !(~n <= 0); 1466#L26 call #t~ret0 := fact(~n - 1);< 1408#$Ultimate##0 ~n := #in~n; 1478#L25 assume ~n <= 0;#res := 1; 1477#factFINAL assume true; 1464#factEXIT >#70#return; 1463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461#factFINAL assume true; 1451#factEXIT >#72#return; 1454#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1462#$Ultimate##0 ~n := #in~n; 1476#L25 assume ~n <= 0;#res := 1; 1475#factFINAL assume true; 1474#factEXIT >#74#return; 1456#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1460#$Ultimate##0 ~n := #in~n; 1468#L25 assume !(~n <= 0); 1466#L26 call #t~ret0 := fact(~n - 1);< 1408#$Ultimate##0 ~n := #in~n; 1478#L25 assume ~n <= 0;#res := 1; 1477#factFINAL assume true; 1464#factEXIT >#70#return; 1463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461#factFINAL assume true; 1451#factEXIT >#76#return; 1459#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1428#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 1429#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1411#L42-3 [2024-10-13 16:57:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2024-10-13 16:57:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:24,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766121637] [2024-10-13 16:57:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:24,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:24,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -685225686, now seen corresponding path program 2 times [2024-10-13 16:57:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813172636] [2024-10-13 16:57:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:24,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991450015] [2024-10-13 16:57:24,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:24,627 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:24,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-13 16:57:24,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:24,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:24,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:24,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:24,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1931548765, now seen corresponding path program 1 times [2024-10-13 16:57:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174319028] [2024-10-13 16:57:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:57:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 16:57:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174319028] [2024-10-13 16:57:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174319028] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548080713] [2024-10-13 16:57:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:24,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:24,795 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:24,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-13 16:57:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:24,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:24,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 16:57:24,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 16:57:24,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548080713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:24,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-10-13 16:57:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202414109] [2024-10-13 16:57:24,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:25,150 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:25,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:25,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:25,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:25,151 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:25,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:25,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:25,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2024-10-13 16:57:25,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:25,151 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:25,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:25,210 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:25,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,213 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 16:57:25,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:25,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:25,230 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:25,230 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:25,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,244 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 16:57:25,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:25,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:25,257 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:25,257 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:25,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,270 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 16:57:25,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:25,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:25,282 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:25,282 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:25,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:25,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,294 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 16:57:25,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:25,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:25,306 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:25,306 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:25,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:25,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,317 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 16:57:25,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:25,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:25,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-13 16:57:25,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,340 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 16:57:25,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:25,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:25,353 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:25,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-13 16:57:25,365 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:25,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:25,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:25,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:25,365 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:25,365 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:25,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:25,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2024-10-13 16:57:25,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:25,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:25,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:25,429 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:25,429 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,431 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 16:57:25,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:25,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:25,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:25,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:25,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:25,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:25,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:25,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:25,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:25,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-13 16:57:25,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,456 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 16:57:25,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:25,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:25,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:25,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:25,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:25,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:25,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:25,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:25,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:25,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:25,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,483 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 16:57:25,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:25,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:25,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:25,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:25,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:25,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:25,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:25,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:25,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:25,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:25,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,508 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 16:57:25,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:25,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:25,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:25,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:25,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:25,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:25,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:25,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:25,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:25,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:25,522 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:25,524 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 16:57:25,525 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:25,525 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:25,525 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:25,525 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 1 Supporting invariants [] [2024-10-13 16:57:25,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-13 16:57:25,536 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:25,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:25,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:25,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:25,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:57:25,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:25,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-13 16:57:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 16:57:25,715 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-10-13 16:57:25,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 130 states and 193 transitions. cyclomatic complexity: 68 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:25,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 130 states and 193 transitions. cyclomatic complexity: 68. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 533 states and 750 transitions. Complement of second has 35 states. [2024-10-13 16:57:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2024-10-13 16:57:25,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 5 letters. Loop has 32 letters. [2024-10-13 16:57:25,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:25,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 37 letters. Loop has 32 letters. [2024-10-13 16:57:25,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:25,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 5 letters. Loop has 64 letters. [2024-10-13 16:57:25,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:25,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 533 states and 750 transitions. [2024-10-13 16:57:25,876 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 69 [2024-10-13 16:57:25,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 533 states to 494 states and 700 transitions. [2024-10-13 16:57:25,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2024-10-13 16:57:25,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2024-10-13 16:57:25,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 700 transitions. [2024-10-13 16:57:25,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:25,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 494 states and 700 transitions. [2024-10-13 16:57:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 700 transitions. [2024-10-13 16:57:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 469. [2024-10-13 16:57:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 299 states have (on average 1.1772575250836121) internal successors, (352), 302 states have internal predecessors, (352), 118 states have call successors, (118), 45 states have call predecessors, (118), 52 states have return successors, (180), 121 states have call predecessors, (180), 116 states have call successors, (180) [2024-10-13 16:57:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 650 transitions. [2024-10-13 16:57:25,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 469 states and 650 transitions. [2024-10-13 16:57:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:25,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 16:57:25,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 16:57:25,918 INFO L87 Difference]: Start difference. First operand 469 states and 650 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-13 16:57:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:26,012 INFO L93 Difference]: Finished difference Result 438 states and 609 transitions. [2024-10-13 16:57:26,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 609 transitions. [2024-10-13 16:57:26,016 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 61 [2024-10-13 16:57:26,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 423 states and 587 transitions. [2024-10-13 16:57:26,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2024-10-13 16:57:26,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-10-13 16:57:26,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 423 states and 587 transitions. [2024-10-13 16:57:26,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:26,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 423 states and 587 transitions. [2024-10-13 16:57:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states and 587 transitions. [2024-10-13 16:57:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 400. [2024-10-13 16:57:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 258 states have (on average 1.189922480620155) internal successors, (307), 263 states have internal predecessors, (307), 98 states have call successors, (98), 41 states have call predecessors, (98), 44 states have return successors, (141), 95 states have call predecessors, (141), 96 states have call successors, (141) [2024-10-13 16:57:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 546 transitions. [2024-10-13 16:57:26,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 400 states and 546 transitions. [2024-10-13 16:57:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 16:57:26,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 400 states and 546 transitions. [2024-10-13 16:57:26,039 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 16:57:26,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 400 states and 546 transitions. [2024-10-13 16:57:26,041 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 61 [2024-10-13 16:57:26,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:26,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:26,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:57:26,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:26,042 INFO L745 eck$LassoCheckResult]: Stem: 3457#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3409#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3410#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3428#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 3458#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3445#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3433#L43 [2024-10-13 16:57:26,042 INFO L747 eck$LassoCheckResult]: Loop: 3433#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3374#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3375#$Ultimate##0 ~n := #in~n; 3531#L25 assume !(~n <= 0); 3437#L26 call #t~ret0 := fact(~n - 1);< 3416#$Ultimate##0 ~n := #in~n; 3627#L25 assume ~n <= 0;#res := 1; 3441#factFINAL assume true; 3514#factEXIT >#70#return; 3515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3548#factFINAL assume true; 3546#factEXIT >#78#return; 3518#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3375#$Ultimate##0 ~n := #in~n; 3531#L25 assume !(~n <= 0); 3437#L26 call #t~ret0 := fact(~n - 1);< 3416#$Ultimate##0 ~n := #in~n; 3627#L25 assume ~n <= 0;#res := 1; 3441#factFINAL assume true; 3514#factEXIT >#70#return; 3515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3548#factFINAL assume true; 3546#factEXIT >#80#return; 3519#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3547#$Ultimate##0 ~n := #in~n; 3580#L25 assume !(~n <= 0); 3437#L26 call #t~ret0 := fact(~n - 1);< 3416#$Ultimate##0 ~n := #in~n; 3627#L25 assume ~n <= 0;#res := 1; 3441#factFINAL assume true; 3514#factEXIT >#70#return; 3515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3548#factFINAL assume true; 3546#factEXIT >#82#return; 3545#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3468#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 3467#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3466#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3433#L43 [2024-10-13 16:57:26,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:26,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 1 times [2024-10-13 16:57:26,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:26,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364141620] [2024-10-13 16:57:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:26,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:26,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:26,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1720459068, now seen corresponding path program 1 times [2024-10-13 16:57:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:26,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183019306] [2024-10-13 16:57:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 16:57:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 16:57:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183019306] [2024-10-13 16:57:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183019306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084350722] [2024-10-13 16:57:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:26,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:26,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:26,179 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:26,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-10-13 16:57:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 16:57:26,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 16:57:26,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 16:57:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084350722] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:26,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2024-10-13 16:57:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572672879] [2024-10-13 16:57:26,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:26,433 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 16:57:26,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-13 16:57:26,434 INFO L87 Difference]: Start difference. First operand 400 states and 546 transitions. cyclomatic complexity: 163 Second operand has 17 states, 13 states have (on average 3.0) internal successors, (39), 15 states have internal predecessors, (39), 11 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 16:57:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:26,662 INFO L93 Difference]: Finished difference Result 602 states and 872 transitions. [2024-10-13 16:57:26,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 872 transitions. [2024-10-13 16:57:26,666 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 90 [2024-10-13 16:57:26,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 602 states and 872 transitions. [2024-10-13 16:57:26,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2024-10-13 16:57:26,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2024-10-13 16:57:26,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 602 states and 872 transitions. [2024-10-13 16:57:26,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:26,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 602 states and 872 transitions. [2024-10-13 16:57:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states and 872 transitions. [2024-10-13 16:57:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 484. [2024-10-13 16:57:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 312 states have (on average 1.1570512820512822) internal successors, (361), 311 states have internal predecessors, (361), 110 states have call successors, (110), 53 states have call predecessors, (110), 62 states have return successors, (231), 119 states have call predecessors, (231), 108 states have call successors, (231) [2024-10-13 16:57:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 702 transitions. [2024-10-13 16:57:26,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 484 states and 702 transitions. [2024-10-13 16:57:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 16:57:26,685 INFO L425 stractBuchiCegarLoop]: Abstraction has 484 states and 702 transitions. [2024-10-13 16:57:26,685 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 16:57:26,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 484 states and 702 transitions. [2024-10-13 16:57:26,688 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 65 [2024-10-13 16:57:26,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:26,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:26,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:57:26,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:26,689 INFO L745 eck$LassoCheckResult]: Stem: 4753#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4696#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4720#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 4707#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4759#L43 [2024-10-13 16:57:26,689 INFO L747 eck$LassoCheckResult]: Loop: 4759#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4675#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4817#$Ultimate##0 ~n := #in~n; 4959#L25 assume !(~n <= 0); 4826#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume !(~n <= 0); 4825#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume ~n <= 0;#res := 1; 4833#factFINAL assume true; 4830#factEXIT >#70#return; 4829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4907#factFINAL assume true; 4822#factEXIT >#70#return; 4820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4815#factFINAL assume true; 4816#factEXIT >#78#return; 4676#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4817#$Ultimate##0 ~n := #in~n; 4959#L25 assume !(~n <= 0); 4826#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume !(~n <= 0); 4825#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume ~n <= 0;#res := 1; 4833#factFINAL assume true; 4830#factEXIT >#70#return; 4829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4907#factFINAL assume true; 4822#factEXIT >#70#return; 4820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4815#factFINAL assume true; 4816#factEXIT >#80#return; 4678#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4773#$Ultimate##0 ~n := #in~n; 4832#L25 assume !(~n <= 0); 4826#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume !(~n <= 0); 4825#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume ~n <= 0;#res := 1; 4833#factFINAL assume true; 4830#factEXIT >#70#return; 4829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4907#factFINAL assume true; 4822#factEXIT >#70#return; 4820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4815#factFINAL assume true; 4816#factEXIT >#82#return; 4769#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4765#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 4766#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4758#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4759#L43 [2024-10-13 16:57:26,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 2 times [2024-10-13 16:57:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:26,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515248656] [2024-10-13 16:57:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:26,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:26,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1714569788, now seen corresponding path program 2 times [2024-10-13 16:57:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300618685] [2024-10-13 16:57:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:57:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 10 proven. 95 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 16:57:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300618685] [2024-10-13 16:57:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300618685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683458413] [2024-10-13 16:57:26,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:26,920 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:26,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-10-13 16:57:26,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:26,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:26,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 16:57:26,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 95 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 16:57:27,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 7 proven. 111 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 16:57:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683458413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:27,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 14] total 22 [2024-10-13 16:57:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336486907] [2024-10-13 16:57:27,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:27,366 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 16:57:27,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-10-13 16:57:27,366 INFO L87 Difference]: Start difference. First operand 484 states and 702 transitions. cyclomatic complexity: 235 Second operand has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-13 16:57:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:27,681 INFO L93 Difference]: Finished difference Result 760 states and 1180 transitions. [2024-10-13 16:57:27,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 760 states and 1180 transitions. [2024-10-13 16:57:27,688 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 102 [2024-10-13 16:57:27,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 760 states to 760 states and 1180 transitions. [2024-10-13 16:57:27,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2024-10-13 16:57:27,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2024-10-13 16:57:27,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 760 states and 1180 transitions. [2024-10-13 16:57:27,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:27,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 760 states and 1180 transitions. [2024-10-13 16:57:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 1180 transitions. [2024-10-13 16:57:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 598. [2024-10-13 16:57:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 384 states have (on average 1.1588541666666667) internal successors, (445), 377 states have internal predecessors, (445), 134 states have call successors, (134), 71 states have call predecessors, (134), 80 states have return successors, (345), 149 states have call predecessors, (345), 132 states have call successors, (345) [2024-10-13 16:57:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 924 transitions. [2024-10-13 16:57:27,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 598 states and 924 transitions. [2024-10-13 16:57:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 16:57:27,712 INFO L425 stractBuchiCegarLoop]: Abstraction has 598 states and 924 transitions. [2024-10-13 16:57:27,712 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 16:57:27,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 598 states and 924 transitions. [2024-10-13 16:57:27,714 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 69 [2024-10-13 16:57:27,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:27,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:27,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:57:27,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:27,716 INFO L745 eck$LassoCheckResult]: Stem: 6459#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6409#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 6432#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 6419#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6420#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6466#L43 [2024-10-13 16:57:27,716 INFO L747 eck$LassoCheckResult]: Loop: 6466#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 6482#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6513#$Ultimate##0 ~n := #in~n; 6537#L25 assume !(~n <= 0); 6524#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume !(~n <= 0); 6527#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume !(~n <= 0); 6527#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6532#factFINAL assume true; 6520#factEXIT >#70#return; 6530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6555#factFINAL assume true; 6547#factEXIT >#70#return; 6549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6560#factFINAL assume true; 6553#factEXIT >#70#return; 6551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6546#factFINAL assume true; 6479#factEXIT >#78#return; 6481#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6513#$Ultimate##0 ~n := #in~n; 6537#L25 assume !(~n <= 0); 6524#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6532#factFINAL assume true; 6520#factEXIT >#70#return; 6519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6517#factFINAL assume true; 6514#factEXIT >#80#return; 6480#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6504#$Ultimate##0 ~n := #in~n; 6536#L25 assume !(~n <= 0); 6524#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6532#factFINAL assume true; 6520#factEXIT >#70#return; 6519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6517#factFINAL assume true; 6514#factEXIT >#82#return; 6483#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 6471#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 6472#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6465#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6466#L43 [2024-10-13 16:57:27,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 3 times [2024-10-13 16:57:27,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:27,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138209140] [2024-10-13 16:57:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:27,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:27,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:27,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 594068860, now seen corresponding path program 3 times [2024-10-13 16:57:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:27,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620976846] [2024-10-13 16:57:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 16:57:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 16:57:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620976846] [2024-10-13 16:57:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620976846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751142466] [2024-10-13 16:57:27,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:27,948 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:27,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-10-13 16:57:27,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-13 16:57:27,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:28,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 16:57:28,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-13 16:57:28,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 16:57:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751142466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:28,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 14] total 25 [2024-10-13 16:57:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295771493] [2024-10-13 16:57:28,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:28,495 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 16:57:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2024-10-13 16:57:28,495 INFO L87 Difference]: Start difference. First operand 598 states and 924 transitions. cyclomatic complexity: 343 Second operand has 25 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2024-10-13 16:57:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:28,891 INFO L93 Difference]: Finished difference Result 892 states and 1388 transitions. [2024-10-13 16:57:28,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1388 transitions. [2024-10-13 16:57:28,897 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 135 [2024-10-13 16:57:28,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1388 transitions. [2024-10-13 16:57:28,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-10-13 16:57:28,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-10-13 16:57:28,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1388 transitions. [2024-10-13 16:57:28,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:28,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 892 states and 1388 transitions. [2024-10-13 16:57:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1388 transitions. [2024-10-13 16:57:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 666. [2024-10-13 16:57:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 420 states have (on average 1.1452380952380952) internal successors, (481), 407 states have internal predecessors, (481), 166 states have call successors, (166), 89 states have call predecessors, (166), 80 states have return successors, (417), 169 states have call predecessors, (417), 164 states have call successors, (417) [2024-10-13 16:57:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1064 transitions. [2024-10-13 16:57:28,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 666 states and 1064 transitions. [2024-10-13 16:57:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 16:57:28,926 INFO L425 stractBuchiCegarLoop]: Abstraction has 666 states and 1064 transitions. [2024-10-13 16:57:28,926 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 16:57:28,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 666 states and 1064 transitions. [2024-10-13 16:57:28,929 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 77 [2024-10-13 16:57:28,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:28,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:28,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:57:28,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:28,930 INFO L745 eck$LassoCheckResult]: Stem: 8369#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 8309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8310#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8332#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 8370#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8425#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8378#L43 [2024-10-13 16:57:28,930 INFO L747 eck$LassoCheckResult]: Loop: 8378#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 8274#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 8275#$Ultimate##0 ~n := #in~n; 8623#L25 assume !(~n <= 0); 8566#L26 call #t~ret0 := fact(~n - 1);< 8574#$Ultimate##0 ~n := #in~n; 8582#L25 assume !(~n <= 0); 8568#L26 call #t~ret0 := fact(~n - 1);< 8574#$Ultimate##0 ~n := #in~n; 8582#L25 assume ~n <= 0;#res := 1; 8581#factFINAL assume true; 8614#factEXIT >#70#return; 8613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8612#factFINAL assume true; 8610#factEXIT >#70#return; 8607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8604#factFINAL assume true; 8605#factEXIT >#78#return; 8583#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 8594#$Ultimate##0 ~n := #in~n; 8589#L25 assume ~n <= 0;#res := 1; 8590#factFINAL assume true; 8618#factEXIT >#80#return; 8587#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 8672#$Ultimate##0 ~n := #in~n; 8678#L25 assume !(~n <= 0); 8566#L26 call #t~ret0 := fact(~n - 1);< 8574#$Ultimate##0 ~n := #in~n; 8582#L25 assume !(~n <= 0); 8568#L26 call #t~ret0 := fact(~n - 1);< 8574#$Ultimate##0 ~n := #in~n; 8582#L25 assume !(~n <= 0); 8568#L26 call #t~ret0 := fact(~n - 1);< 8574#$Ultimate##0 ~n := #in~n; 8582#L25 assume ~n <= 0;#res := 1; 8581#factFINAL assume true; 8614#factEXIT >#70#return; 8613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8612#factFINAL assume true; 8610#factEXIT >#70#return; 8573#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8575#factFINAL assume true; 8565#factEXIT >#70#return; 8571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8608#factFINAL assume true; 8609#factEXIT >#82#return; 8671#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 8384#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 8385#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8377#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8378#L43 [2024-10-13 16:57:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 4 times [2024-10-13 16:57:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548905091] [2024-10-13 16:57:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:28,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:28,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1182186108, now seen corresponding path program 4 times [2024-10-13 16:57:28,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:28,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231017111] [2024-10-13 16:57:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498487387] [2024-10-13 16:57:28,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:28,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:28,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:28,955 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:28,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-10-13 16:57:29,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:29,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:29,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:29,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:29,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash -487527381, now seen corresponding path program 1 times [2024-10-13 16:57:29,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:29,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124162665] [2024-10-13 16:57:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 16:57:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-13 16:57:29,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124162665] [2024-10-13 16:57:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124162665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:57:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932601636] [2024-10-13 16:57:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:29,387 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:29,387 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:29,387 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:29,387 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:29,387 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:29,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:29,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:29,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2024-10-13 16:57:29,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:29,388 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:29,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:29,445 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,446 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 16:57:29,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:29,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,459 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:29,460 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:29,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-13 16:57:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,472 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 16:57:29,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:29,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,484 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:29,485 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:29,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-13 16:57:29,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,496 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 16:57:29,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:29,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,508 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:29,508 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:29,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:29,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,520 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 16:57:29,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:29,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,535 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:29,535 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:29,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-13 16:57:29,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,547 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 16:57:29,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:29,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:29,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,580 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 16:57:29,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:29,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:29,593 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:29,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-13 16:57:29,604 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:29,604 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:29,604 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:29,604 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:29,604 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:29,604 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,604 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:29,604 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:29,604 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2024-10-13 16:57:29,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:29,604 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:29,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:29,654 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:29,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,656 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 16:57:29,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:29,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:29,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:29,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:29,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:29,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:29,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:29,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:29,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:29,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:29,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,681 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 16:57:29,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:29,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:29,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:29,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:29,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:29,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:29,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:29,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:29,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:29,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,706 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 16:57:29,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:29,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:29,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:29,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:29,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:29,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:29,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:29,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:29,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:29,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 16:57:29,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,740 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-13 16:57:29,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:29,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:29,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:29,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:29,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:29,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:29,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:29,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:29,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:29,755 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:29,756 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:29,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:29,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:29,770 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:29,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 16:57:29,771 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:29,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:29,771 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:29,771 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2024-10-13 16:57:29,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-13 16:57:29,782 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:29,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:29,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:29,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 16:57:29,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 16:57:30,006 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-13 16:57:30,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 666 states and 1064 transitions. cyclomatic complexity: 415 Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 16:57:30,242 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 666 states and 1064 transitions. cyclomatic complexity: 415. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 1627 states and 2374 transitions. Complement of second has 53 states. [2024-10-13 16:57:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 16:57:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2024-10-13 16:57:30,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 6 letters. Loop has 50 letters. [2024-10-13 16:57:30,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 56 letters. Loop has 50 letters. [2024-10-13 16:57:30,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 68 transitions. Stem has 6 letters. Loop has 100 letters. [2024-10-13 16:57:30,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1627 states and 2374 transitions. [2024-10-13 16:57:30,264 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 68 [2024-10-13 16:57:30,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1627 states to 1102 states and 1652 transitions. [2024-10-13 16:57:30,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2024-10-13 16:57:30,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2024-10-13 16:57:30,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1102 states and 1652 transitions. [2024-10-13 16:57:30,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:30,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1102 states and 1652 transitions. [2024-10-13 16:57:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states and 1652 transitions. [2024-10-13 16:57:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 851. [2024-10-13 16:57:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 544 states have (on average 1.1488970588235294) internal successors, (625), 532 states have internal predecessors, (625), 190 states have call successors, (190), 106 states have call predecessors, (190), 117 states have return successors, (480), 212 states have call predecessors, (480), 186 states have call successors, (480) [2024-10-13 16:57:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1295 transitions. [2024-10-13 16:57:30,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 851 states and 1295 transitions. [2024-10-13 16:57:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:30,335 INFO L87 Difference]: Start difference. First operand 851 states and 1295 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 16:57:30,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-13 16:57:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:30,380 INFO L93 Difference]: Finished difference Result 703 states and 1063 transitions. [2024-10-13 16:57:30,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 703 states and 1063 transitions. [2024-10-13 16:57:30,385 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 62 [2024-10-13 16:57:30,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 703 states to 703 states and 1063 transitions. [2024-10-13 16:57:30,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2024-10-13 16:57:30,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2024-10-13 16:57:30,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 703 states and 1063 transitions. [2024-10-13 16:57:30,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:30,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 703 states and 1063 transitions. [2024-10-13 16:57:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states and 1063 transitions. [2024-10-13 16:57:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 699. [2024-10-13 16:57:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 448 states have (on average 1.1383928571428572) internal successors, (510), 438 states have internal predecessors, (510), 156 states have call successors, (156), 88 states have call predecessors, (156), 95 states have return successors, (393), 172 states have call predecessors, (393), 152 states have call successors, (393) [2024-10-13 16:57:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1059 transitions. [2024-10-13 16:57:30,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 699 states and 1059 transitions. [2024-10-13 16:57:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:30,414 INFO L425 stractBuchiCegarLoop]: Abstraction has 699 states and 1059 transitions. [2024-10-13 16:57:30,414 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 16:57:30,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 699 states and 1059 transitions. [2024-10-13 16:57:30,418 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-13 16:57:30,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:30,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:30,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:30,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:57:30,420 INFO L745 eck$LassoCheckResult]: Stem: 12544#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 12495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12496#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12517#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 12505#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12506#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12528#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12491#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12492#$Ultimate##0 ~n := #in~n; 12680#L25 assume !(~n <= 0); 12472#L26 call #t~ret0 := fact(~n - 1);< 12502#$Ultimate##0 [2024-10-13 16:57:30,420 INFO L747 eck$LassoCheckResult]: Loop: 12502#$Ultimate##0 ~n := #in~n; 12724#L25 assume !(~n <= 0); 12475#L26 call #t~ret0 := fact(~n - 1);< 12502#$Ultimate##0 [2024-10-13 16:57:30,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 271742545, now seen corresponding path program 1 times [2024-10-13 16:57:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665710678] [2024-10-13 16:57:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:30,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665710678] [2024-10-13 16:57:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665710678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:30,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:30,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 16:57:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326350256] [2024-10-13 16:57:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:30,448 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:30,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2024-10-13 16:57:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912271235] [2024-10-13 16:57:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:30,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:30,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:30,476 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:30,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:30,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:30,477 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:30,477 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:30,477 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,477 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:30,477 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:30,477 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2024-10-13 16:57:30,477 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:30,477 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:30,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:30,504 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,506 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-13 16:57:30,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:30,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:30,523 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:30,523 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:30,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,537 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-13 16:57:30,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:30,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:30,551 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:30,551 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:30,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:30,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,563 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-13 16:57:30,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:30,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:30,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-13 16:57:30,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,587 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-13 16:57:30,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:30,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:30,640 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:30,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-13 16:57:30,645 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:30,645 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:30,645 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:30,645 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:30,645 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:30,645 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,645 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:30,645 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:30,645 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2024-10-13 16:57:30,645 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:30,645 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:30,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:30,673 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:30,673 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,674 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-13 16:57:30,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:30,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:30,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:30,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,700 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-13 16:57:30,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:30,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:30,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-13 16:57:30,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,726 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-13 16:57:30,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:30,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:30,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-13 16:57:30,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,752 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-13 16:57:30,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:30,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:30,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:30,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:30,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:30,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:30,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:30,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:30,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:30,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:30,768 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:30,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:30,769 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:30,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-13 16:57:30,771 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:30,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:30,771 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:30,771 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-10-13 16:57:30,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-13 16:57:30,782 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:30,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:30,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:57:30,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:30,838 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 16:57:30,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 699 states and 1059 transitions. cyclomatic complexity: 377 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:30,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 699 states and 1059 transitions. cyclomatic complexity: 377. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 970 states and 1468 transitions. Complement of second has 17 states. [2024-10-13 16:57:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2024-10-13 16:57:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2024-10-13 16:57:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 16:57:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-13 16:57:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:30,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 970 states and 1468 transitions. [2024-10-13 16:57:30,887 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-13 16:57:30,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 970 states to 911 states and 1403 transitions. [2024-10-13 16:57:30,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2024-10-13 16:57:30,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2024-10-13 16:57:30,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 911 states and 1403 transitions. [2024-10-13 16:57:30,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:30,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 911 states and 1403 transitions. [2024-10-13 16:57:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states and 1403 transitions. [2024-10-13 16:57:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 901. [2024-10-13 16:57:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 572 states have (on average 1.1573426573426573) internal successors, (662), 585 states have internal predecessors, (662), 206 states have call successors, (206), 126 states have call predecessors, (206), 123 states have return successors, (510), 189 states have call predecessors, (510), 202 states have call successors, (510) [2024-10-13 16:57:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1378 transitions. [2024-10-13 16:57:30,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 901 states and 1378 transitions. [2024-10-13 16:57:30,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:30,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:57:30,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:57:30,913 INFO L87 Difference]: Start difference. First operand 901 states and 1378 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:30,958 INFO L93 Difference]: Finished difference Result 903 states and 1379 transitions. [2024-10-13 16:57:30,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 903 states and 1379 transitions. [2024-10-13 16:57:30,964 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-13 16:57:30,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 903 states to 903 states and 1379 transitions. [2024-10-13 16:57:30,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2024-10-13 16:57:30,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2024-10-13 16:57:30,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 903 states and 1379 transitions. [2024-10-13 16:57:30,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:30,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 903 states and 1379 transitions. [2024-10-13 16:57:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states and 1379 transitions. [2024-10-13 16:57:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2024-10-13 16:57:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 572 states have (on average 1.1555944055944056) internal successors, (661), 585 states have internal predecessors, (661), 206 states have call successors, (206), 126 states have call predecessors, (206), 123 states have return successors, (510), 189 states have call predecessors, (510), 202 states have call successors, (510) [2024-10-13 16:57:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1377 transitions. [2024-10-13 16:57:30,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 901 states and 1377 transitions. [2024-10-13 16:57:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:57:30,988 INFO L425 stractBuchiCegarLoop]: Abstraction has 901 states and 1377 transitions. [2024-10-13 16:57:30,988 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 16:57:30,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 901 states and 1377 transitions. [2024-10-13 16:57:30,992 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-10-13 16:57:30,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:30,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:30,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:30,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:57:30,992 INFO L745 eck$LassoCheckResult]: Stem: 16107#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 16045#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16046#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 16069#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 16057#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16058#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16088#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16252#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16329#$Ultimate##0 ~n := #in~n; 16334#L25 assume ~n <= 0;#res := 1; 16333#factFINAL assume true; 16328#factEXIT >#72#return; 16307#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16314#$Ultimate##0 ~n := #in~n; 16310#L25 assume !(~n <= 0); 16263#L26 call #t~ret0 := fact(~n - 1);< 16304#$Ultimate##0 ~n := #in~n; 16305#L25 assume ~n <= 0;#res := 1; 16369#factFINAL assume true; 16262#factEXIT >#70#return; 16265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16335#factFINAL assume true; 16330#factEXIT >#74#return; 16276#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16095#$Ultimate##0 ~n := #in~n; 16326#L25 assume !(~n <= 0); 16292#L26 call #t~ret0 := fact(~n - 1);< 16053#$Ultimate##0 [2024-10-13 16:57:30,992 INFO L747 eck$LassoCheckResult]: Loop: 16053#$Ultimate##0 ~n := #in~n; 16343#L25 assume !(~n <= 0); 16291#L26 call #t~ret0 := fact(~n - 1);< 16053#$Ultimate##0 [2024-10-13 16:57:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1844396785, now seen corresponding path program 1 times [2024-10-13 16:57:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518395498] [2024-10-13 16:57:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:57:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518395498] [2024-10-13 16:57:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518395498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276385888] [2024-10-13 16:57:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:31,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:31,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,044 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-10-13 16:57:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:57:31,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:57:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276385888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:31,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:31,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-10-13 16:57:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259591449] [2024-10-13 16:57:31,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:31,143 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 2 times [2024-10-13 16:57:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087366774] [2024-10-13 16:57:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:31,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:31,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:31,171 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:31,172 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:31,172 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:31,172 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:31,172 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:31,172 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,172 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:31,172 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:31,172 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-10-13 16:57:31,172 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:31,172 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:31,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,190 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:31,190 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:31,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,191 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-13 16:57:31,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:31,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:31,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-13 16:57:31,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,215 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-13 16:57:31,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:31,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:31,242 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:31,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:31,245 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:31,245 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:31,245 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:31,246 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:31,246 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:31,246 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,246 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:31,246 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:31,246 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-10-13 16:57:31,246 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:31,246 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:31,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:31,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:31,282 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:31,283 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,284 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-13 16:57:31,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-13 16:57:31,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:31,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:31,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:31,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:31,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:31,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:31,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:31,297 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:31,299 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:31,299 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:31,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:31,300 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:31,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-13 16:57:31,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:31,303 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:31,304 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:31,304 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-10-13 16:57:31,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-13 16:57:31,315 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:31,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:31,501 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-13 16:57:31,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 901 states and 1377 transitions. cyclomatic complexity: 501 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:31,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 901 states and 1377 transitions. cyclomatic complexity: 501. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 968 states and 1459 transitions. Complement of second has 17 states. [2024-10-13 16:57:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-10-13 16:57:31,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 27 letters. Loop has 3 letters. [2024-10-13 16:57:31,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:31,583 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:31,749 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-13 16:57:31,749 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 901 states and 1377 transitions. cyclomatic complexity: 501 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:31,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 901 states and 1377 transitions. cyclomatic complexity: 501. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 968 states and 1459 transitions. Complement of second has 17 states. [2024-10-13 16:57:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-10-13 16:57:31,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 27 letters. Loop has 3 letters. [2024-10-13 16:57:31,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:31,824 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:31,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:57:31,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:31,984 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 3 loop predicates [2024-10-13 16:57:31,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 901 states and 1377 transitions. cyclomatic complexity: 501 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:32,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 901 states and 1377 transitions. cyclomatic complexity: 501. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1129 states and 1659 transitions. Complement of second has 19 states. [2024-10-13 16:57:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 16:57:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2024-10-13 16:57:32,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 27 letters. Loop has 3 letters. [2024-10-13 16:57:32,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:32,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 30 letters. Loop has 3 letters. [2024-10-13 16:57:32,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:32,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 27 letters. Loop has 6 letters. [2024-10-13 16:57:32,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:32,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1129 states and 1659 transitions. [2024-10-13 16:57:32,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2024-10-13 16:57:32,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1129 states to 921 states and 1414 transitions. [2024-10-13 16:57:32,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2024-10-13 16:57:32,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 170 [2024-10-13 16:57:32,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 921 states and 1414 transitions. [2024-10-13 16:57:32,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:32,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 921 states and 1414 transitions. [2024-10-13 16:57:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states and 1414 transitions. [2024-10-13 16:57:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 847. [2024-10-13 16:57:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 541 states have (on average 1.1571164510166358) internal successors, (626), 546 states have internal predecessors, (626), 188 states have call successors, (188), 120 states have call predecessors, (188), 118 states have return successors, (472), 180 states have call predecessors, (472), 188 states have call successors, (472) [2024-10-13 16:57:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1286 transitions. [2024-10-13 16:57:32,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 847 states and 1286 transitions. [2024-10-13 16:57:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 16:57:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 16:57:32,108 INFO L87 Difference]: Start difference. First operand 847 states and 1286 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 16:57:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:32,186 INFO L93 Difference]: Finished difference Result 899 states and 1380 transitions. [2024-10-13 16:57:32,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 899 states and 1380 transitions. [2024-10-13 16:57:32,192 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2024-10-13 16:57:32,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 899 states to 893 states and 1370 transitions. [2024-10-13 16:57:32,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2024-10-13 16:57:32,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2024-10-13 16:57:32,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 893 states and 1370 transitions. [2024-10-13 16:57:32,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:32,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 893 states and 1370 transitions. [2024-10-13 16:57:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states and 1370 transitions. [2024-10-13 16:57:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 861. [2024-10-13 16:57:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 541 states have (on average 1.1534195933456561) internal successors, (624), 552 states have internal predecessors, (624), 200 states have call successors, (200), 120 states have call predecessors, (200), 120 states have return successors, (492), 188 states have call predecessors, (492), 200 states have call successors, (492) [2024-10-13 16:57:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1316 transitions. [2024-10-13 16:57:32,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 861 states and 1316 transitions. [2024-10-13 16:57:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 16:57:32,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 861 states and 1316 transitions. [2024-10-13 16:57:32,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 16:57:32,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 861 states and 1316 transitions. [2024-10-13 16:57:32,246 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2024-10-13 16:57:32,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:32,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:32,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:32,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:32,251 INFO L745 eck$LassoCheckResult]: Stem: 22357#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 22303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 22304#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 22325#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 22313#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22314#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22340#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22719#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22721#$Ultimate##0 ~n := #in~n; 22724#L25 assume ~n <= 0;#res := 1; 22722#factFINAL assume true; 22718#factEXIT >#72#return; 22715#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22717#$Ultimate##0 ~n := #in~n; 22725#L25 assume ~n <= 0;#res := 1; 22723#factFINAL assume true; 22714#factEXIT >#74#return; 22712#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22713#$Ultimate##0 ~n := #in~n; 22728#L25 assume ~n <= 0;#res := 1; 22727#factFINAL assume true; 22711#factEXIT >#76#return; 22709#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22708#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 22536#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22507#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22329#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22331#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22676#$Ultimate##0 ~n := #in~n; 22750#L25 assume ~n <= 0;#res := 1; 22749#factFINAL assume true; 22742#factEXIT >#78#return; 22732#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22735#$Ultimate##0 ~n := #in~n; 22778#L25 assume ~n <= 0;#res := 1; 22777#factFINAL assume true; 22731#factEXIT >#80#return; 22630#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22772#$Ultimate##0 ~n := #in~n; 22771#L25 assume !(~n <= 0); 22645#L26 call #t~ret0 := fact(~n - 1);< 22700#$Ultimate##0 ~n := #in~n; 22779#L25 assume ~n <= 0;#res := 1; 22699#factFINAL assume true; 22644#factEXIT >#70#return; 22648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22767#factFINAL assume true; 22734#factEXIT >#82#return; 22626#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22623#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 22532#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22518#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22509#L43 [2024-10-13 16:57:32,251 INFO L747 eck$LassoCheckResult]: Loop: 22509#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22333#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22352#$Ultimate##0 ~n := #in~n; 22504#L25 assume !(~n <= 0); 22285#L26 call #t~ret0 := fact(~n - 1);< 22615#$Ultimate##0 ~n := #in~n; 22613#L25 assume !(~n <= 0); 22590#L26 call #t~ret0 := fact(~n - 1);< 22594#$Ultimate##0 ~n := #in~n; 22613#L25 assume !(~n <= 0); 22590#L26 call #t~ret0 := fact(~n - 1);< 22594#$Ultimate##0 ~n := #in~n; 22612#L25 assume ~n <= 0;#res := 1; 22611#factFINAL assume true; 22610#factEXIT >#70#return; 22609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22607#factFINAL assume true; 22605#factEXIT >#70#return; 22592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22593#factFINAL assume true; 22588#factEXIT >#70#return; 22587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22584#factFINAL assume true; 22582#factEXIT >#78#return; 22334#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22352#$Ultimate##0 ~n := #in~n; 22504#L25 assume !(~n <= 0); 22285#L26 call #t~ret0 := fact(~n - 1);< 22615#$Ultimate##0 ~n := #in~n; 22613#L25 assume !(~n <= 0); 22590#L26 call #t~ret0 := fact(~n - 1);< 22594#$Ultimate##0 ~n := #in~n; 22613#L25 assume !(~n <= 0); 22590#L26 call #t~ret0 := fact(~n - 1);< 22594#$Ultimate##0 ~n := #in~n; 22612#L25 assume ~n <= 0;#res := 1; 22611#factFINAL assume true; 22610#factEXIT >#70#return; 22609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22607#factFINAL assume true; 22605#factEXIT >#70#return; 22592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22593#factFINAL assume true; 22588#factEXIT >#70#return; 22587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22584#factFINAL assume true; 22582#factEXIT >#80#return; 22335#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22347#$Ultimate##0 ~n := #in~n; 22348#L25 assume !(~n <= 0); 22285#L26 call #t~ret0 := fact(~n - 1);< 22615#$Ultimate##0 ~n := #in~n; 22341#L25 assume ~n <= 0;#res := 1; 22298#factFINAL assume true; 22284#factEXIT >#70#return; 22286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22336#factFINAL assume true; 22789#factEXIT >#82#return; 22427#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22426#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 22354#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22355#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22509#L43 [2024-10-13 16:57:32,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash -758704542, now seen corresponding path program 1 times [2024-10-13 16:57:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202751569] [2024-10-13 16:57:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:32,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-13 16:57:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:57:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:57:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 16:57:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:57:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 16:57:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202751569] [2024-10-13 16:57:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202751569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690098215] [2024-10-13 16:57:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:32,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,330 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2024-10-13 16:57:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:57:32,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 16:57:32,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:57:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690098215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:32,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 16:57:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-10-13 16:57:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620140164] [2024-10-13 16:57:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:32,415 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1164973636, now seen corresponding path program 5 times [2024-10-13 16:57:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:32,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645345853] [2024-10-13 16:57:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 16:57:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 20 proven. 117 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-13 16:57:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645345853] [2024-10-13 16:57:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645345853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469895359] [2024-10-13 16:57:32,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:57:32,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:32,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:32,667 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:32,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2024-10-13 16:57:32,764 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-13 16:57:32,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:32,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 16:57:32,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 20 proven. 134 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 16:57:32,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 20 proven. 149 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-13 16:57:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469895359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:33,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:33,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 18] total 30 [2024-10-13 16:57:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13873825] [2024-10-13 16:57:33,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:33,456 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:33,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 16:57:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 16:57:33,457 INFO L87 Difference]: Start difference. First operand 861 states and 1316 transitions. cyclomatic complexity: 474 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-13 16:57:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:33,565 INFO L93 Difference]: Finished difference Result 775 states and 1149 transitions. [2024-10-13 16:57:33,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 775 states and 1149 transitions. [2024-10-13 16:57:33,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2024-10-13 16:57:33,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 775 states to 611 states and 918 transitions. [2024-10-13 16:57:33,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2024-10-13 16:57:33,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2024-10-13 16:57:33,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 611 states and 918 transitions. [2024-10-13 16:57:33,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:33,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 611 states and 918 transitions. [2024-10-13 16:57:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states and 918 transitions. [2024-10-13 16:57:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 587. [2024-10-13 16:57:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 381 states have (on average 1.1338582677165354) internal successors, (432), 378 states have internal predecessors, (432), 128 states have call successors, (128), 78 states have call predecessors, (128), 78 states have return successors, (314), 130 states have call predecessors, (314), 128 states have call successors, (314) [2024-10-13 16:57:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 874 transitions. [2024-10-13 16:57:33,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 587 states and 874 transitions. [2024-10-13 16:57:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 16:57:33,591 INFO L425 stractBuchiCegarLoop]: Abstraction has 587 states and 874 transitions. [2024-10-13 16:57:33,591 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-13 16:57:33,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 587 states and 874 transitions. [2024-10-13 16:57:33,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2024-10-13 16:57:33,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:33,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:33,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:33,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:33,595 INFO L745 eck$LassoCheckResult]: Stem: 24704#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 24653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 24654#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 24676#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 24663#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24664#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24951#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24949#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24950#$Ultimate##0 ~n := #in~n; 24953#L25 assume ~n <= 0;#res := 1; 24952#factFINAL assume true; 24948#factEXIT >#72#return; 24946#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24947#$Ultimate##0 ~n := #in~n; 24955#L25 assume ~n <= 0;#res := 1; 24954#factFINAL assume true; 24945#factEXIT >#74#return; 24943#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24944#$Ultimate##0 ~n := #in~n; 24960#L25 assume !(~n <= 0); 24961#L26 call #t~ret0 := fact(~n - 1);< 24968#$Ultimate##0 ~n := #in~n; 24974#L25 assume ~n <= 0;#res := 1; 24973#factFINAL assume true; 24967#factEXIT >#70#return; 24962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24963#factFINAL assume true; 24942#factEXIT >#76#return; 24668#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24669#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 24682#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25106#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24692#L43 [2024-10-13 16:57:33,595 INFO L747 eck$LassoCheckResult]: Loop: 24692#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24629#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24630#$Ultimate##0 ~n := #in~n; 24698#L25 assume !(~n <= 0); 24638#L26 call #t~ret0 := fact(~n - 1);< 25092#$Ultimate##0 ~n := #in~n; 25082#L25 assume !(~n <= 0); 25018#L26 call #t~ret0 := fact(~n - 1);< 25068#$Ultimate##0 ~n := #in~n; 25082#L25 assume !(~n <= 0); 25018#L26 call #t~ret0 := fact(~n - 1);< 25068#$Ultimate##0 ~n := #in~n; 25083#L25 assume ~n <= 0;#res := 1; 25085#factFINAL assume true; 25078#factEXIT >#70#return; 25076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25073#factFINAL assume true; 25070#factEXIT >#70#return; 25021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25067#factFINAL assume true; 25017#factEXIT >#70#return; 25014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25013#factFINAL assume true; 25012#factEXIT >#78#return; 24648#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24630#$Ultimate##0 ~n := #in~n; 24698#L25 assume !(~n <= 0); 24638#L26 call #t~ret0 := fact(~n - 1);< 25092#$Ultimate##0 ~n := #in~n; 25082#L25 assume !(~n <= 0); 25018#L26 call #t~ret0 := fact(~n - 1);< 25068#$Ultimate##0 ~n := #in~n; 25082#L25 assume !(~n <= 0); 25018#L26 call #t~ret0 := fact(~n - 1);< 25068#$Ultimate##0 ~n := #in~n; 25083#L25 assume ~n <= 0;#res := 1; 25085#factFINAL assume true; 25078#factEXIT >#70#return; 25076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25073#factFINAL assume true; 25070#factEXIT >#70#return; 25021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25067#factFINAL assume true; 25017#factEXIT >#70#return; 25014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25013#factFINAL assume true; 25012#factEXIT >#80#return; 24685#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24705#$Ultimate##0 ~n := #in~n; 25094#L25 assume !(~n <= 0); 24638#L26 call #t~ret0 := fact(~n - 1);< 25092#$Ultimate##0 ~n := #in~n; 25082#L25 assume !(~n <= 0); 25018#L26 call #t~ret0 := fact(~n - 1);< 25068#$Ultimate##0 ~n := #in~n; 25082#L25 assume !(~n <= 0); 25018#L26 call #t~ret0 := fact(~n - 1);< 25068#$Ultimate##0 ~n := #in~n; 25083#L25 assume ~n <= 0;#res := 1; 25085#factFINAL assume true; 25078#factEXIT >#70#return; 25076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25073#factFINAL assume true; 25070#factEXIT >#70#return; 25021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25067#factFINAL assume true; 25017#factEXIT >#70#return; 25014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25013#factFINAL assume true; 25012#factEXIT >#82#return; 24655#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24656#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 24677#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 24691#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24692#L43 [2024-10-13 16:57:33,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash -946042969, now seen corresponding path program 2 times [2024-10-13 16:57:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:33,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659276610] [2024-10-13 16:57:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:57:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 16:57:33,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:33,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659276610] [2024-10-13 16:57:33,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659276610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:33,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950688069] [2024-10-13 16:57:33,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:33,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:33,681 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:33,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2024-10-13 16:57:33,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:33,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:33,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:57:33,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 16:57:33,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 16:57:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950688069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:33,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-13 16:57:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85242359] [2024-10-13 16:57:33,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:33,846 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1836658684, now seen corresponding path program 6 times [2024-10-13 16:57:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404753299] [2024-10-13 16:57:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:33,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 16:57:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 20 proven. 183 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-10-13 16:57:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404753299] [2024-10-13 16:57:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404753299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039878203] [2024-10-13 16:57:34,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:57:34,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:34,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:34,145 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:34,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2024-10-13 16:57:34,211 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2024-10-13 16:57:34,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:34,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 16:57:34,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 61 proven. 171 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-13 16:57:34,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 61 proven. 190 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-13 16:57:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039878203] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:34,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:34,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 18] total 32 [2024-10-13 16:57:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365032831] [2024-10-13 16:57:34,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:34,926 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:34,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:34,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 16:57:34,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 16:57:34,926 INFO L87 Difference]: Start difference. First operand 587 states and 874 transitions. cyclomatic complexity: 302 Second operand has 13 states, 10 states have (on average 2.7) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-13 16:57:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:35,092 INFO L93 Difference]: Finished difference Result 624 states and 959 transitions. [2024-10-13 16:57:35,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 624 states and 959 transitions. [2024-10-13 16:57:35,096 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 75 [2024-10-13 16:57:35,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 624 states to 582 states and 899 transitions. [2024-10-13 16:57:35,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2024-10-13 16:57:35,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2024-10-13 16:57:35,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 899 transitions. [2024-10-13 16:57:35,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:35,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 582 states and 899 transitions. [2024-10-13 16:57:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 899 transitions. [2024-10-13 16:57:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2024-10-13 16:57:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 370 states have (on average 1.127027027027027) internal successors, (417), 365 states have internal predecessors, (417), 140 states have call successors, (140), 74 states have call predecessors, (140), 70 states have return successors, (340), 140 states have call predecessors, (340), 140 states have call successors, (340) [2024-10-13 16:57:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 897 transitions. [2024-10-13 16:57:35,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 580 states and 897 transitions. [2024-10-13 16:57:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 16:57:35,111 INFO L425 stractBuchiCegarLoop]: Abstraction has 580 states and 897 transitions. [2024-10-13 16:57:35,111 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-13 16:57:35,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 580 states and 897 transitions. [2024-10-13 16:57:35,114 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 75 [2024-10-13 16:57:35,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:35,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:35,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:35,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:35,115 INFO L745 eck$LassoCheckResult]: Stem: 26770#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 26717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 26718#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 26742#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 26729#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 26730#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26927#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26706#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26707#$Ultimate##0 ~n := #in~n; 26897#L25 assume ~n <= 0;#res := 1; 26895#factFINAL assume true; 26893#factEXIT >#72#return; 26762#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26763#$Ultimate##0 ~n := #in~n; 26925#L25 assume ~n <= 0;#res := 1; 26924#factFINAL assume true; 26922#factEXIT >#74#return; 26696#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26697#$Ultimate##0 ~n := #in~n; 26935#L25 assume ~n <= 0;#res := 1; 26934#factFINAL assume true; 26933#factEXIT >#76#return; 26738#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 26739#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 26750#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26932#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26747#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26748#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26962#$Ultimate##0 ~n := #in~n; 27060#L25 assume !(~n <= 0); 27002#L26 call #t~ret0 := fact(~n - 1);< 27059#$Ultimate##0 ~n := #in~n; 27065#L25 assume ~n <= 0;#res := 1; 27063#factFINAL assume true; 27058#factEXIT >#70#return; 26993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27057#factFINAL assume true; 27026#factEXIT >#78#return; 26950#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26953#$Ultimate##0 ~n := #in~n; 27007#L25 assume ~n <= 0;#res := 1; 26996#factFINAL assume true; 26949#factEXIT >#80#return; 26946#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26947#$Ultimate##0 ~n := #in~n; 27009#L25 assume !(~n <= 0); 26990#L26 call #t~ret0 := fact(~n - 1);< 26998#$Ultimate##0 ~n := #in~n; 27000#L25 assume ~n <= 0;#res := 1; 26997#factFINAL assume true; 26989#factEXIT >#70#return; 26987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26964#factFINAL assume true; 26952#factEXIT >#82#return; 26942#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 26940#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 26938#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26936#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26754#L43 [2024-10-13 16:57:35,115 INFO L747 eck$LassoCheckResult]: Loop: 26754#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26692#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26693#$Ultimate##0 ~n := #in~n; 27069#L25 assume !(~n <= 0); 26701#L26 call #t~ret0 := fact(~n - 1);< 27020#$Ultimate##0 ~n := #in~n; 26919#L25 assume !(~n <= 0); 26906#L26 call #t~ret0 := fact(~n - 1);< 26909#$Ultimate##0 ~n := #in~n; 26919#L25 assume !(~n <= 0); 26906#L26 call #t~ret0 := fact(~n - 1);< 26909#$Ultimate##0 ~n := #in~n; 26920#L25 assume ~n <= 0;#res := 1; 26921#factFINAL assume true; 26918#factEXIT >#70#return; 26917#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26915#factFINAL assume true; 26911#factEXIT >#70#return; 26907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26908#factFINAL assume true; 26903#factEXIT >#70#return; 26900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26896#factFINAL assume true; 26894#factEXIT >#78#return; 26711#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26693#$Ultimate##0 ~n := #in~n; 27069#L25 assume !(~n <= 0); 26701#L26 call #t~ret0 := fact(~n - 1);< 27020#$Ultimate##0 ~n := #in~n; 26919#L25 assume !(~n <= 0); 26906#L26 call #t~ret0 := fact(~n - 1);< 26909#$Ultimate##0 ~n := #in~n; 26920#L25 assume ~n <= 0;#res := 1; 26921#factFINAL assume true; 26918#factEXIT >#70#return; 26917#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26915#factFINAL assume true; 26911#factEXIT >#70#return; 26912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27066#factFINAL assume true; 27064#factEXIT >#80#return; 26712#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26771#$Ultimate##0 ~n := #in~n; 27043#L25 assume !(~n <= 0); 26701#L26 call #t~ret0 := fact(~n - 1);< 27020#$Ultimate##0 ~n := #in~n; 26919#L25 assume !(~n <= 0); 26906#L26 call #t~ret0 := fact(~n - 1);< 26909#$Ultimate##0 ~n := #in~n; 26920#L25 assume ~n <= 0;#res := 1; 26921#factFINAL assume true; 26918#factEXIT >#70#return; 26917#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26915#factFINAL assume true; 26911#factEXIT >#70#return; 26912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27066#factFINAL assume true; 27064#factEXIT >#82#return; 26888#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 26743#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 26744#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26753#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26754#L43 [2024-10-13 16:57:35,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 2 times [2024-10-13 16:57:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571149580] [2024-10-13 16:57:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856297349] [2024-10-13 16:57:35,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:35,125 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2024-10-13 16:57:35,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:35,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:35,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:35,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1713692996, now seen corresponding path program 7 times [2024-10-13 16:57:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125571350] [2024-10-13 16:57:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 16:57:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 32 proven. 97 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-13 16:57:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:35,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125571350] [2024-10-13 16:57:35,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125571350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:35,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853211781] [2024-10-13 16:57:35,465 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:57:35,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:35,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:35,467 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:35,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-10-13 16:57:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:35,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 16:57:35,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 128 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-13 16:57:35,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 141 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-13 16:57:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853211781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:36,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 16] total 28 [2024-10-13 16:57:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609969489] [2024-10-13 16:57:36,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:36,170 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:36,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 16:57:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-10-13 16:57:36,171 INFO L87 Difference]: Start difference. First operand 580 states and 897 transitions. cyclomatic complexity: 331 Second operand has 28 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-13 16:57:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:36,589 INFO L93 Difference]: Finished difference Result 868 states and 1481 transitions. [2024-10-13 16:57:36,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 868 states and 1481 transitions. [2024-10-13 16:57:36,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 147 [2024-10-13 16:57:36,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 868 states to 862 states and 1475 transitions. [2024-10-13 16:57:36,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 315 [2024-10-13 16:57:36,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 315 [2024-10-13 16:57:36,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 862 states and 1475 transitions. [2024-10-13 16:57:36,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:36,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 862 states and 1475 transitions. [2024-10-13 16:57:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states and 1475 transitions. [2024-10-13 16:57:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 676. [2024-10-13 16:57:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 416 states have (on average 1.1129807692307692) internal successors, (463), 405 states have internal predecessors, (463), 176 states have call successors, (176), 84 states have call predecessors, (176), 84 states have return successors, (540), 186 states have call predecessors, (540), 176 states have call successors, (540) [2024-10-13 16:57:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1179 transitions. [2024-10-13 16:57:36,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 676 states and 1179 transitions. [2024-10-13 16:57:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 16:57:36,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 676 states and 1179 transitions. [2024-10-13 16:57:36,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-13 16:57:36,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 676 states and 1179 transitions. [2024-10-13 16:57:36,624 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 89 [2024-10-13 16:57:36,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:36,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:36,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:36,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:36,626 INFO L745 eck$LassoCheckResult]: Stem: 28773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 28722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 28723#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28741#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 28774#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 28836#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28834#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28835#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28860#$Ultimate##0 ~n := #in~n; 28864#L25 assume ~n <= 0;#res := 1; 28863#factFINAL assume true; 28859#factEXIT >#72#return; 28854#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28855#$Ultimate##0 ~n := #in~n; 28862#L25 assume ~n <= 0;#res := 1; 28858#factFINAL assume true; 28853#factEXIT >#74#return; 28848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28849#$Ultimate##0 ~n := #in~n; 28857#L25 assume ~n <= 0;#res := 1; 28852#factFINAL assume true; 28847#factEXIT >#76#return; 28846#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28845#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 28841#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28842#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28746#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28747#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29045#$Ultimate##0 ~n := #in~n; 29044#L25 assume !(~n <= 0); 29035#L26 call #t~ret0 := fact(~n - 1);< 29042#$Ultimate##0 ~n := #in~n; 29048#L25 assume ~n <= 0;#res := 1; 29046#factFINAL assume true; 29041#factEXIT >#70#return; 29029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29019#factFINAL assume true; 29015#factEXIT >#78#return; 29000#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29003#$Ultimate##0 ~n := #in~n; 29077#L25 assume ~n <= 0;#res := 1; 29059#factFINAL assume true; 28999#factEXIT >#80#return; 28997#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28998#$Ultimate##0 ~n := #in~n; 29060#L25 assume !(~n <= 0); 29026#L26 call #t~ret0 := fact(~n - 1);< 29040#$Ultimate##0 ~n := #in~n; 29056#L25 assume ~n <= 0;#res := 1; 29039#factFINAL assume true; 29024#factEXIT >#70#return; 29018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29014#factFINAL assume true; 29002#factEXIT >#82#return; 28995#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28992#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 28991#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28989#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28757#L43 [2024-10-13 16:57:36,626 INFO L747 eck$LassoCheckResult]: Loop: 28757#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28672#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28673#$Ultimate##0 ~n := #in~n; 29083#L25 assume !(~n <= 0); 28677#L26 call #t~ret0 := fact(~n - 1);< 29079#$Ultimate##0 ~n := #in~n; 28986#L25 assume !(~n <= 0); 28966#L26 call #t~ret0 := fact(~n - 1);< 28976#$Ultimate##0 ~n := #in~n; 28986#L25 assume !(~n <= 0); 28966#L26 call #t~ret0 := fact(~n - 1);< 28976#$Ultimate##0 ~n := #in~n; 28985#L25 assume ~n <= 0;#res := 1; 28984#factFINAL assume true; 28982#factEXIT >#70#return; 28981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28979#factFINAL assume true; 28978#factEXIT >#70#return; 28977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28975#factFINAL assume true; 28964#factEXIT >#70#return; 28970#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28955#factFINAL assume true; 28956#factEXIT >#78#return; 28710#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28673#$Ultimate##0 ~n := #in~n; 29083#L25 assume !(~n <= 0); 28677#L26 call #t~ret0 := fact(~n - 1);< 29079#$Ultimate##0 ~n := #in~n; 28986#L25 assume !(~n <= 0); 28966#L26 call #t~ret0 := fact(~n - 1);< 28976#$Ultimate##0 ~n := #in~n; 28986#L25 assume !(~n <= 0); 28966#L26 call #t~ret0 := fact(~n - 1);< 28976#$Ultimate##0 ~n := #in~n; 28986#L25 assume !(~n <= 0); 28966#L26 call #t~ret0 := fact(~n - 1);< 28976#$Ultimate##0 ~n := #in~n; 28985#L25 assume ~n <= 0;#res := 1; 28984#factFINAL assume true; 28982#factEXIT >#70#return; 28981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28979#factFINAL assume true; 28978#factEXIT >#70#return; 28977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28975#factFINAL assume true; 28964#factEXIT >#70#return; 28969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28994#factFINAL assume true; 28974#factEXIT >#70#return; 28962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28963#factFINAL assume true; 28951#factEXIT >#80#return; 28727#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28775#$Ultimate##0 ~n := #in~n; 28972#L25 assume !(~n <= 0); 28678#L26 call #t~ret0 := fact(~n - 1);< 28728#$Ultimate##0 ~n := #in~n; 28760#L25 assume ~n <= 0;#res := 1; 28761#factFINAL assume true; 28676#factEXIT >#70#return; 28679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29081#factFINAL assume true; 29082#factEXIT >#82#return; 28952#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28742#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 28743#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28756#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28757#L43 [2024-10-13 16:57:36,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 3 times [2024-10-13 16:57:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:36,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750822018] [2024-10-13 16:57:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:36,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193150539] [2024-10-13 16:57:36,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:36,640 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:36,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2024-10-13 16:57:36,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-13 16:57:36,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:36,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:36,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:36,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1772918468, now seen corresponding path program 8 times [2024-10-13 16:57:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:36,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059273977] [2024-10-13 16:57:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 16:57:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 16:57:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 29 proven. 141 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 16:57:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059273977] [2024-10-13 16:57:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059273977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625915311] [2024-10-13 16:57:36,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:36,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:36,986 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:36,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2024-10-13 16:57:37,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:37,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:37,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 16:57:37,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 110 proven. 110 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 16:57:37,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 24 proven. 177 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 16:57:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625915311] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:37,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 18] total 29 [2024-10-13 16:57:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114793374] [2024-10-13 16:57:37,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:37,633 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:37,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 16:57:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2024-10-13 16:57:37,634 INFO L87 Difference]: Start difference. First operand 676 states and 1179 transitions. cyclomatic complexity: 517 Second operand has 29 states, 25 states have (on average 2.4) internal successors, (60), 23 states have internal predecessors, (60), 16 states have call successors, (18), 2 states have call predecessors, (18), 9 states have return successors, (25), 15 states have call predecessors, (25), 16 states have call successors, (25) [2024-10-13 16:57:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:38,020 INFO L93 Difference]: Finished difference Result 876 states and 1499 transitions. [2024-10-13 16:57:38,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 876 states and 1499 transitions. [2024-10-13 16:57:38,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 122 [2024-10-13 16:57:38,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 876 states to 870 states and 1493 transitions. [2024-10-13 16:57:38,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2024-10-13 16:57:38,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2024-10-13 16:57:38,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 870 states and 1493 transitions. [2024-10-13 16:57:38,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:38,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 870 states and 1493 transitions. [2024-10-13 16:57:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states and 1493 transitions. [2024-10-13 16:57:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 724. [2024-10-13 16:57:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 450 states have (on average 1.1355555555555557) internal successors, (511), 433 states have internal predecessors, (511), 190 states have call successors, (190), 104 states have call predecessors, (190), 84 states have return successors, (546), 186 states have call predecessors, (546), 190 states have call successors, (546) [2024-10-13 16:57:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1247 transitions. [2024-10-13 16:57:38,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 724 states and 1247 transitions. [2024-10-13 16:57:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 16:57:38,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 724 states and 1247 transitions. [2024-10-13 16:57:38,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-13 16:57:38,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 724 states and 1247 transitions. [2024-10-13 16:57:38,054 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 89 [2024-10-13 16:57:38,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:38,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:38,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:38,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:38,055 INFO L745 eck$LassoCheckResult]: Stem: 30935#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 30873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 30874#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 30898#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 30885#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 30886#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30903#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30844#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30845#$Ultimate##0 ~n := #in~n; 31099#L25 assume ~n <= 0;#res := 1; 31096#factFINAL assume true; 31092#factEXIT >#72#return; 31093#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31176#$Ultimate##0 ~n := #in~n; 31180#L25 assume ~n <= 0;#res := 1; 31179#factFINAL assume true; 31175#factEXIT >#74#return; 31173#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31174#$Ultimate##0 ~n := #in~n; 31186#L25 assume ~n <= 0;#res := 1; 31184#factFINAL assume true; 31172#factEXIT >#76#return; 31167#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30905#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 30906#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 31187#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31185#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 31116#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31168#$Ultimate##0 ~n := #in~n; 31164#L25 assume !(~n <= 0); 31141#L26 call #t~ret0 := fact(~n - 1);< 31149#$Ultimate##0 ~n := #in~n; 31162#L25 assume ~n <= 0;#res := 1; 31160#factFINAL assume true; 31148#factEXIT >#70#return; 31135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31126#factFINAL assume true; 31121#factEXIT >#78#return; 31106#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31107#$Ultimate##0 ~n := #in~n; 31123#L25 assume ~n <= 0;#res := 1; 31110#factFINAL assume true; 31105#factEXIT >#80#return; 31101#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31102#$Ultimate##0 ~n := #in~n; 31166#L25 assume !(~n <= 0); 31132#L26 call #t~ret0 := fact(~n - 1);< 31155#$Ultimate##0 ~n := #in~n; 31152#L25 assume ~n <= 0;#res := 1; 31139#factFINAL assume true; 31129#factEXIT >#70#return; 31122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31109#factFINAL assume true; 31103#factEXIT >#82#return; 31098#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 31095#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 31091#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 31089#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31088#L43 [2024-10-13 16:57:38,055 INFO L747 eck$LassoCheckResult]: Loop: 31088#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 31078#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31196#$Ultimate##0 ~n := #in~n; 31226#L25 assume !(~n <= 0); 30833#L26 call #t~ret0 := fact(~n - 1);< 31223#$Ultimate##0 ~n := #in~n; 31235#L25 assume !(~n <= 0); 30835#L26 call #t~ret0 := fact(~n - 1);< 31232#$Ultimate##0 ~n := #in~n; 31235#L25 assume !(~n <= 0); 30835#L26 call #t~ret0 := fact(~n - 1);< 31232#$Ultimate##0 ~n := #in~n; 31236#L25 assume ~n <= 0;#res := 1; 31237#factFINAL assume true; 31234#factEXIT >#70#return; 31233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31231#factFINAL assume true; 31209#factEXIT >#70#return; 31210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31241#factFINAL assume true; 30832#factEXIT >#70#return; 30838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31194#factFINAL assume true; 31195#factEXIT >#78#return; 30929#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30930#$Ultimate##0 ~n := #in~n; 31224#L25 assume !(~n <= 0); 30880#L26 call #t~ret0 := fact(~n - 1);< 31212#$Ultimate##0 ~n := #in~n; 31277#L25 assume !(~n <= 0); 30879#L26 call #t~ret0 := fact(~n - 1);< 30881#$Ultimate##0 ~n := #in~n; 31236#L25 assume ~n <= 0;#res := 1; 31237#factFINAL assume true; 31234#factEXIT >#70#return; 31233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31231#factFINAL assume true; 31209#factEXIT >#70#return; 31208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31204#factFINAL assume true; 31199#factEXIT >#80#return; 30936#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30937#$Ultimate##0 ~n := #in~n; 31225#L25 assume !(~n <= 0); 31206#L26 call #t~ret0 := fact(~n - 1);< 31207#$Ultimate##0 ~n := #in~n; 31239#L25 assume ~n <= 0;#res := 1; 31238#factFINAL assume true; 31205#factEXIT >#70#return; 31203#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31202#factFINAL assume true; 31200#factEXIT >#82#return; 31082#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30899#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 30900#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 30933#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31088#L43 [2024-10-13 16:57:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 4 times [2024-10-13 16:57:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494942618] [2024-10-13 16:57:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:38,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935284843] [2024-10-13 16:57:38,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:38,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,065 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2024-10-13 16:57:38,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:38,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:38,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:38,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:38,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1902607612, now seen corresponding path program 9 times [2024-10-13 16:57:38,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:38,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174851341] [2024-10-13 16:57:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:38,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514154990] [2024-10-13 16:57:38,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:38,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,166 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-10-13 16:57:38,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-13 16:57:38,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:38,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:38,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:38,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:38,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1821592669, now seen corresponding path program 5 times [2024-10-13 16:57:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365079368] [2024-10-13 16:57:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:57:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:57:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:57:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:57:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:57:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 16:57:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 16:57:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 59 proven. 13 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-10-13 16:57:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365079368] [2024-10-13 16:57:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365079368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121967925] [2024-10-13 16:57:38,393 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:57:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:38,395 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:38,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-10-13 16:57:38,491 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-13 16:57:38,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:38,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 16:57:38,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 155 proven. 65 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2024-10-13 16:57:38,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 155 proven. 67 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-10-13 16:57:38,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121967925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:38,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:38,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 14] total 22 [2024-10-13 16:57:38,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874195594] [2024-10-13 16:57:38,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:39,196 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:39,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:39,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:39,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:39,196 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:39,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:39,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:39,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2024-10-13 16:57:39,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:39,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:39,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,250 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:39,250 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:39,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,256 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-13 16:57:39,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:39,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,270 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:39,270 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:39,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-13 16:57:39,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,286 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-13 16:57:39,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:39,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,299 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:39,299 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:39,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-13 16:57:39,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,314 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-13 16:57:39,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:39,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,326 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:39,326 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:39,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-13 16:57:39,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,341 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-13 16:57:39,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:39,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,355 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:39,355 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:39,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:39,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,367 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-13 16:57:39,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:39,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-13 16:57:39,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,391 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-13 16:57:39,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:39,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:39,407 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:39,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-13 16:57:39,418 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:39,418 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:39,418 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:39,418 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:39,418 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:39,418 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,418 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:39,418 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:39,418 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2024-10-13 16:57:39,418 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:39,418 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:39,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:39,467 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:39,467 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:39,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,468 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-13 16:57:39,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:39,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:39,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:39,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:39,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:39,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:39,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:39,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:39,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:39,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-13 16:57:39,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,494 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-13 16:57:39,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:39,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:39,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:39,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:39,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:39,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:39,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:39,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:39,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:39,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:39,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,519 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-13 16:57:39,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:39,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:39,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:39,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:39,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:39,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:39,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:39,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:39,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:39,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-13 16:57:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,544 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-13 16:57:39,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:39,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:39,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:39,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:39,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:39,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:39,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:39,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:39,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:39,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-13 16:57:39,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,567 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-13 16:57:39,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:39,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:39,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:39,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:39,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:39,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:39,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:39,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:39,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:39,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:39,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:39,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:39,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:39,583 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:39,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-10-13 16:57:39,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:39,584 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:39,584 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:39,584 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2024-10-13 16:57:39,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-13 16:57:39,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:39,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-10-13 16:57:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:39,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 16:57:39,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-13 16:57:40,074 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-13 16:57:40,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 724 states and 1247 transitions. cyclomatic complexity: 537 Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-13 16:57:40,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 724 states and 1247 transitions. cyclomatic complexity: 537. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 1316 states and 2056 transitions. Complement of second has 65 states. [2024-10-13 16:57:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-13 16:57:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2024-10-13 16:57:40,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 67 transitions. Stem has 58 letters. Loop has 56 letters. [2024-10-13 16:57:40,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:40,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 67 transitions. Stem has 114 letters. Loop has 56 letters. [2024-10-13 16:57:40,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:40,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 67 transitions. Stem has 58 letters. Loop has 112 letters. [2024-10-13 16:57:40,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:40,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1316 states and 2056 transitions. [2024-10-13 16:57:40,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2024-10-13 16:57:40,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1316 states to 961 states and 1565 transitions. [2024-10-13 16:57:40,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2024-10-13 16:57:40,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2024-10-13 16:57:40,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 961 states and 1565 transitions. [2024-10-13 16:57:40,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:40,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 961 states and 1565 transitions. [2024-10-13 16:57:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states and 1565 transitions. [2024-10-13 16:57:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 904. [2024-10-13 16:57:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 568 states have (on average 1.130281690140845) internal successors, (642), 555 states have internal predecessors, (642), 218 states have call successors, (218), 124 states have call predecessors, (218), 118 states have return successors, (616), 224 states have call predecessors, (616), 218 states have call successors, (616) [2024-10-13 16:57:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1476 transitions. [2024-10-13 16:57:40,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 904 states and 1476 transitions. [2024-10-13 16:57:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 16:57:40,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-10-13 16:57:40,376 INFO L87 Difference]: Start difference. First operand 904 states and 1476 transitions. Second operand has 22 states, 16 states have (on average 3.5625) internal successors, (57), 20 states have internal predecessors, (57), 15 states have call successors, (26), 1 states have call predecessors, (26), 4 states have return successors, (27), 14 states have call predecessors, (27), 15 states have call successors, (27) [2024-10-13 16:57:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:41,061 INFO L93 Difference]: Finished difference Result 1509 states and 2853 transitions. [2024-10-13 16:57:41,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2853 transitions. [2024-10-13 16:57:41,088 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 271 [2024-10-13 16:57:41,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1445 states and 2751 transitions. [2024-10-13 16:57:41,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2024-10-13 16:57:41,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2024-10-13 16:57:41,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1445 states and 2751 transitions. [2024-10-13 16:57:41,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:41,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1445 states and 2751 transitions. [2024-10-13 16:57:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states and 2751 transitions. [2024-10-13 16:57:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 994. [2024-10-13 16:57:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 600 states have (on average 1.1366666666666667) internal successors, (682), 587 states have internal predecessors, (682), 294 states have call successors, (294), 102 states have call predecessors, (294), 100 states have return successors, (844), 304 states have call predecessors, (844), 294 states have call successors, (844) [2024-10-13 16:57:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1820 transitions. [2024-10-13 16:57:41,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 994 states and 1820 transitions. [2024-10-13 16:57:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 16:57:41,140 INFO L425 stractBuchiCegarLoop]: Abstraction has 994 states and 1820 transitions. [2024-10-13 16:57:41,140 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-13 16:57:41,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 994 states and 1820 transitions. [2024-10-13 16:57:41,143 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 186 [2024-10-13 16:57:41,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:41,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:41,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:41,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:41,145 INFO L745 eck$LassoCheckResult]: Stem: 36701#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 36634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 36635#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 36659#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 36646#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 36647#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36663#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 36664#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36988#$Ultimate##0 ~n := #in~n; 36990#L25 assume ~n <= 0;#res := 1; 36989#factFINAL assume true; 36987#factEXIT >#72#return; 36984#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36985#$Ultimate##0 ~n := #in~n; 36992#L25 assume ~n <= 0;#res := 1; 36991#factFINAL assume true; 36983#factEXIT >#74#return; 36980#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36981#$Ultimate##0 ~n := #in~n; 36986#L25 assume ~n <= 0;#res := 1; 36982#factFINAL assume true; 36979#factEXIT >#76#return; 36978#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 36977#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 36976#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36973#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36974#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37077#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37132#$Ultimate##0 ~n := #in~n; 37140#L25 assume !(~n <= 0); 37043#L26 call #t~ret0 := fact(~n - 1);< 37158#$Ultimate##0 ~n := #in~n; 37160#L25 assume ~n <= 0;#res := 1; 37159#factFINAL assume true; 37157#factEXIT >#70#return; 37027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37156#factFINAL assume true; 37155#factEXIT >#78#return; 37034#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37035#$Ultimate##0 ~n := #in~n; 37039#L25 assume ~n <= 0;#res := 1; 37040#factFINAL assume true; 37033#factEXIT >#80#return; 37017#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37018#$Ultimate##0 ~n := #in~n; 37030#L25 assume !(~n <= 0); 37025#L26 call #t~ret0 := fact(~n - 1);< 37053#$Ultimate##0 ~n := #in~n; 37054#L25 assume !(~n <= 0); 37045#L26 call #t~ret0 := fact(~n - 1);< 37127#$Ultimate##0 ~n := #in~n; 37129#L25 assume ~n <= 0;#res := 1; 37128#factFINAL assume true; 37125#factEXIT >#70#return; 37126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37150#factFINAL assume true; 37122#factEXIT >#70#return; 37022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37023#factFINAL assume true; 37016#factEXIT >#82#return; 37015#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37013#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 37011#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 37012#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36957#L43 [2024-10-13 16:57:41,145 INFO L747 eck$LassoCheckResult]: Loop: 36957#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 36641#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36971#$Ultimate##0 ~n := #in~n; 36967#L25 assume !(~n <= 0); 36640#L26 call #t~ret0 := fact(~n - 1);< 36642#$Ultimate##0 ~n := #in~n; 36970#L25 assume !(~n <= 0); 36678#L26 call #t~ret0 := fact(~n - 1);< 36969#$Ultimate##0 ~n := #in~n; 36970#L25 assume !(~n <= 0); 36678#L26 call #t~ret0 := fact(~n - 1);< 36969#$Ultimate##0 ~n := #in~n; 36970#L25 assume !(~n <= 0); 36678#L26 call #t~ret0 := fact(~n - 1);< 36969#$Ultimate##0 ~n := #in~n; 36676#L25 assume ~n <= 0;#res := 1; 36679#factFINAL assume true; 37009#factEXIT >#70#return; 37008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37007#factFINAL assume true; 37006#factEXIT >#70#return; 37005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37004#factFINAL assume true; 37003#factEXIT >#70#return; 37001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37002#factFINAL assume true; 37000#factEXIT >#70#return; 36999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36998#factFINAL assume true; 36997#factEXIT >#78#return; 36694#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36695#$Ultimate##0 ~n := #in~n; 36968#L25 assume ~n <= 0;#res := 1; 36966#factFINAL assume true; 36963#factEXIT >#80#return; 36616#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36702#$Ultimate##0 ~n := #in~n; 36964#L25 assume !(~n <= 0); 36993#L26 call #t~ret0 := fact(~n - 1);< 36642#$Ultimate##0 ~n := #in~n; 36970#L25 assume !(~n <= 0); 36678#L26 call #t~ret0 := fact(~n - 1);< 36969#$Ultimate##0 ~n := #in~n; 36970#L25 assume !(~n <= 0); 36678#L26 call #t~ret0 := fact(~n - 1);< 36969#$Ultimate##0 ~n := #in~n; 36970#L25 assume !(~n <= 0); 36678#L26 call #t~ret0 := fact(~n - 1);< 36969#$Ultimate##0 ~n := #in~n; 36676#L25 assume ~n <= 0;#res := 1; 36679#factFINAL assume true; 37009#factEXIT >#70#return; 37008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37007#factFINAL assume true; 37006#factEXIT >#70#return; 37005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37004#factFINAL assume true; 37003#factEXIT >#70#return; 37001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37002#factFINAL assume true; 37000#factEXIT >#70#return; 36999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36998#factFINAL assume true; 36997#factEXIT >#82#return; 36617#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 36660#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 36661#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36960#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36957#L43 [2024-10-13 16:57:41,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash -199564382, now seen corresponding path program 6 times [2024-10-13 16:57:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177579000] [2024-10-13 16:57:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:57:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:57:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:57:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:57:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-13 16:57:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177579000] [2024-10-13 16:57:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177579000] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771362782] [2024-10-13 16:57:41,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:57:41,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,296 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2024-10-13 16:57:41,378 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-10-13 16:57:41,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:41,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 16:57:41,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 50 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-13 16:57:41,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 16:57:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771362782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:41,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:41,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 18 [2024-10-13 16:57:41,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181963902] [2024-10-13 16:57:41,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:41,618 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1775231612, now seen corresponding path program 10 times [2024-10-13 16:57:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009873324] [2024-10-13 16:57:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464467937] [2024-10-13 16:57:41,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:41,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,630 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2024-10-13 16:57:41,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:41,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:41,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:42,151 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:42,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:42,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:42,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:42,151 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:42,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:42,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:42,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-10-13 16:57:42,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:42,151 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:42,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,219 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:42,219 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:42,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,221 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-13 16:57:42,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,235 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,235 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-13 16:57:42,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,248 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-13 16:57:42,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,262 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,262 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-13 16:57:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,275 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-13 16:57:42,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,288 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,289 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-13 16:57:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,301 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-13 16:57:42,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,314 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,314 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-13 16:57:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,327 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-13 16:57:42,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,341 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,342 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-13 16:57:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,355 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-13 16:57:42,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,367 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,367 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,381 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-13 16:57:42,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,395 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,395 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,407 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-13 16:57:42,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,427 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,427 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=5} Honda state: {ULTIMATE.start_main_~x~0#1=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,439 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-13 16:57:42,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,452 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:42,452 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:42,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-13 16:57:42,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,464 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-13 16:57:42,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:42,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,488 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-10-13 16:57:42,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:42,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:42,505 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:42,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-10-13 16:57:42,516 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:42,516 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:42,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:42,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:42,516 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:42,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:42,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:42,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-10-13 16:57:42,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:42,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:42,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:42,573 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:42,573 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,574 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-13 16:57:42,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-10-13 16:57:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,598 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-13 16:57:42,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-13 16:57:42,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,623 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-13 16:57:42,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-10-13 16:57:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,652 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-13 16:57:42,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-13 16:57:42,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,679 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-13 16:57:42,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,704 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-13 16:57:42,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,729 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-13 16:57:42,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,754 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-13 16:57:42,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,777 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-13 16:57:42,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,803 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-10-13 16:57:42,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:42,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,827 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-10-13 16:57:42,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:42,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:42,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:42,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:42,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:42,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:42,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:42,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:42,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:42,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:42,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:42,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:42,843 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:42,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-10-13 16:57:42,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:42,844 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:42,844 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:42,844 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 9 Supporting invariants [] [2024-10-13 16:57:42,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:42,855 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:42,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:57:42,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:43,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 16:57:43,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-13 16:57:43,391 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2024-10-13 16:57:43,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 994 states and 1820 transitions. cyclomatic complexity: 846 Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-13 16:57:43,673 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 994 states and 1820 transitions. cyclomatic complexity: 846. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Result 1967 states and 3116 transitions. Complement of second has 77 states. [2024-10-13 16:57:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-13 16:57:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2024-10-13 16:57:43,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 66 transitions. Stem has 64 letters. Loop has 68 letters. [2024-10-13 16:57:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 66 transitions. Stem has 132 letters. Loop has 68 letters. [2024-10-13 16:57:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 66 transitions. Stem has 64 letters. Loop has 136 letters. [2024-10-13 16:57:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:43,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1967 states and 3116 transitions. [2024-10-13 16:57:43,685 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 186 [2024-10-13 16:57:43,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1967 states to 1385 states and 2350 transitions. [2024-10-13 16:57:43,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2024-10-13 16:57:43,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2024-10-13 16:57:43,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1385 states and 2350 transitions. [2024-10-13 16:57:43,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:43,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1385 states and 2350 transitions. [2024-10-13 16:57:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states and 2350 transitions. [2024-10-13 16:57:43,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-10-13 16:57:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1182. [2024-10-13 16:57:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 724 states have (on average 1.1312154696132597) internal successors, (819), 711 states have internal predecessors, (819), 324 states have call successors, (324), 124 states have call predecessors, (324), 134 states have return successors, (950), 346 states have call predecessors, (950), 324 states have call successors, (950) [2024-10-13 16:57:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 2093 transitions. [2024-10-13 16:57:43,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1182 states and 2093 transitions. [2024-10-13 16:57:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 16:57:43,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-13 16:57:43,766 INFO L87 Difference]: Start difference. First operand 1182 states and 2093 transitions. Second operand has 18 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 11 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-13 16:57:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:44,091 INFO L93 Difference]: Finished difference Result 1324 states and 2396 transitions. [2024-10-13 16:57:44,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1324 states and 2396 transitions. [2024-10-13 16:57:44,102 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 203 [2024-10-13 16:57:44,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1324 states to 1252 states and 2228 transitions. [2024-10-13 16:57:44,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2024-10-13 16:57:44,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2024-10-13 16:57:44,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1252 states and 2228 transitions. [2024-10-13 16:57:44,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:44,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1252 states and 2228 transitions. [2024-10-13 16:57:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states and 2228 transitions. [2024-10-13 16:57:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1130. [2024-10-13 16:57:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 684 states have (on average 1.1257309941520468) internal successors, (770), 677 states have internal predecessors, (770), 310 states have call successors, (310), 112 states have call predecessors, (310), 136 states have return successors, (858), 340 states have call predecessors, (858), 310 states have call successors, (858) [2024-10-13 16:57:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1938 transitions. [2024-10-13 16:57:44,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1130 states and 1938 transitions. [2024-10-13 16:57:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 16:57:44,146 INFO L425 stractBuchiCegarLoop]: Abstraction has 1130 states and 1938 transitions. [2024-10-13 16:57:44,146 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-13 16:57:44,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1130 states and 1938 transitions. [2024-10-13 16:57:44,149 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 170 [2024-10-13 16:57:44,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:44,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:44,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:44,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:44,151 INFO L745 eck$LassoCheckResult]: Stem: 43138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 43083#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 43084#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 43105#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 43093#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43095#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43109#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43110#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43486#$Ultimate##0 ~n := #in~n; 43489#L25 assume ~n <= 0;#res := 1; 43488#factFINAL assume true; 43485#factEXIT >#72#return; 43481#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43482#$Ultimate##0 ~n := #in~n; 43487#L25 assume ~n <= 0;#res := 1; 43484#factFINAL assume true; 43480#factEXIT >#74#return; 43477#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43478#$Ultimate##0 ~n := #in~n; 43483#L25 assume ~n <= 0;#res := 1; 43479#factFINAL assume true; 43476#factEXIT >#76#return; 43475#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43474#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 43473#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43472#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43471#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43446#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43448#$Ultimate##0 ~n := #in~n; 43531#L25 assume !(~n <= 0); 43522#L26 call #t~ret0 := fact(~n - 1);< 43524#$Ultimate##0 ~n := #in~n; 43537#L25 assume ~n <= 0;#res := 1; 43529#factFINAL assume true; 43521#factEXIT >#70#return; 43516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43514#factFINAL assume true; 43445#factEXIT >#78#return; 43437#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43438#$Ultimate##0 ~n := #in~n; 43443#L25 assume ~n <= 0;#res := 1; 43439#factFINAL assume true; 43435#factEXIT >#80#return; 43430#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43539#$Ultimate##0 ~n := #in~n; 43535#L25 assume !(~n <= 0); 43520#L26 call #t~ret0 := fact(~n - 1);< 43523#$Ultimate##0 ~n := #in~n; 43534#L25 assume ~n <= 0;#res := 1; 43528#factFINAL assume true; 43518#factEXIT >#70#return; 43444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43433#factFINAL assume true; 43434#factEXIT >#82#return; 43427#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43425#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 43426#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43526#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43125#L43 [2024-10-13 16:57:44,151 INFO L747 eck$LassoCheckResult]: Loop: 43125#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43057#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43058#$Ultimate##0 ~n := #in~n; 43415#L25 assume !(~n <= 0); 43077#L26 call #t~ret0 := fact(~n - 1);< 43089#$Ultimate##0 ~n := #in~n; 43131#L25 assume !(~n <= 0); 43066#L26 call #t~ret0 := fact(~n - 1);< 43406#$Ultimate##0 ~n := #in~n; 43131#L25 assume !(~n <= 0); 43066#L26 call #t~ret0 := fact(~n - 1);< 43406#$Ultimate##0 ~n := #in~n; 43131#L25 assume !(~n <= 0); 43066#L26 call #t~ret0 := fact(~n - 1);< 43406#$Ultimate##0 ~n := #in~n; 43131#L25 assume !(~n <= 0); 43066#L26 call #t~ret0 := fact(~n - 1);< 43406#$Ultimate##0 ~n := #in~n; 43119#L25 assume ~n <= 0;#res := 1; 43120#factFINAL assume true; 43065#factEXIT >#70#return; 43067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43117#factFINAL assume true; 43419#factEXIT >#70#return; 43420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43075#factFINAL assume true; 43078#factEXIT >#70#return; 43424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43423#factFINAL assume true; 43422#factEXIT >#70#return; 43412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43421#factFINAL assume true; 43410#factEXIT >#70#return; 43411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43404#factFINAL assume true; 43405#factEXIT >#78#return; 43133#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43134#$Ultimate##0 ~n := #in~n; 43407#L25 assume ~n <= 0;#res := 1; 43414#factFINAL assume true; 43413#factEXIT >#80#return; 43139#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43140#$Ultimate##0 ~n := #in~n; 43245#L25 assume !(~n <= 0); 43076#L26 call #t~ret0 := fact(~n - 1);< 43089#$Ultimate##0 ~n := #in~n; 43131#L25 assume !(~n <= 0); 43066#L26 call #t~ret0 := fact(~n - 1);< 43406#$Ultimate##0 ~n := #in~n; 43119#L25 assume ~n <= 0;#res := 1; 43120#factFINAL assume true; 43065#factEXIT >#70#return; 43067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43117#factFINAL assume true; 43419#factEXIT >#70#return; 43408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43409#factFINAL assume true; 43403#factEXIT >#82#return; 43402#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43401#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 43137#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43124#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43125#L43 [2024-10-13 16:57:44,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 7 times [2024-10-13 16:57:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245549101] [2024-10-13 16:57:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375654233] [2024-10-13 16:57:44,159 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:57:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:44,161 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:44,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2024-10-13 16:57:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:44,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:44,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:44,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1312274244, now seen corresponding path program 11 times [2024-10-13 16:57:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:44,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797268658] [2024-10-13 16:57:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 16:57:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 16:57:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 79 proven. 58 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-13 16:57:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:44,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797268658] [2024-10-13 16:57:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797268658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247455615] [2024-10-13 16:57:44,466 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:57:44,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:44,468 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:44,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2024-10-13 16:57:44,541 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-13 16:57:44,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:44,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 16:57:44,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 16:57:44,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 65 proven. 103 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-13 16:57:45,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247455615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:45,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:45,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 17] total 31 [2024-10-13 16:57:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379008860] [2024-10-13 16:57:45,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:45,234 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 16:57:45,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2024-10-13 16:57:45,235 INFO L87 Difference]: Start difference. First operand 1130 states and 1938 transitions. cyclomatic complexity: 831 Second operand has 31 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 18 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-13 16:57:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:45,884 INFO L93 Difference]: Finished difference Result 1576 states and 2584 transitions. [2024-10-13 16:57:45,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1576 states and 2584 transitions. [2024-10-13 16:57:45,892 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 306 [2024-10-13 16:57:45,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1576 states to 1556 states and 2564 transitions. [2024-10-13 16:57:45,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2024-10-13 16:57:45,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2024-10-13 16:57:45,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1556 states and 2564 transitions. [2024-10-13 16:57:45,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:45,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1556 states and 2564 transitions. [2024-10-13 16:57:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states and 2564 transitions. [2024-10-13 16:57:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1259. [2024-10-13 16:57:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 747 states have (on average 1.1151271753681393) internal successors, (833), 737 states have internal predecessors, (833), 376 states have call successors, (376), 145 states have call predecessors, (376), 136 states have return successors, (946), 376 states have call predecessors, (946), 376 states have call successors, (946) [2024-10-13 16:57:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2155 transitions. [2024-10-13 16:57:45,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1259 states and 2155 transitions. [2024-10-13 16:57:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-13 16:57:45,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 1259 states and 2155 transitions. [2024-10-13 16:57:45,942 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-13 16:57:45,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 2155 transitions. [2024-10-13 16:57:45,945 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 186 [2024-10-13 16:57:45,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:45,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:45,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:45,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:45,946 INFO L745 eck$LassoCheckResult]: Stem: 46464#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 46404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 46405#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 46424#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 46465#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 46487#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46485#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 46486#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46875#$Ultimate##0 ~n := #in~n; 46878#L25 assume ~n <= 0;#res := 1; 46877#factFINAL assume true; 46874#factEXIT >#72#return; 46870#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46871#$Ultimate##0 ~n := #in~n; 46876#L25 assume ~n <= 0;#res := 1; 46873#factFINAL assume true; 46869#factEXIT >#74#return; 46866#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46867#$Ultimate##0 ~n := #in~n; 46872#L25 assume ~n <= 0;#res := 1; 46868#factFINAL assume true; 46865#factEXIT >#76#return; 46864#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 46862#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 46863#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 46845#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46846#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 46768#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46769#$Ultimate##0 ~n := #in~n; 46841#L25 assume !(~n <= 0); 46842#L26 call #t~ret0 := fact(~n - 1);< 46888#$Ultimate##0 ~n := #in~n; 46890#L25 assume ~n <= 0;#res := 1; 46986#factFINAL assume true; 46985#factEXIT >#70#return; 46835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46770#factFINAL assume true; 46771#factEXIT >#78#return; 46756#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46758#$Ultimate##0 ~n := #in~n; 46762#L25 assume ~n <= 0;#res := 1; 46763#factFINAL assume true; 46755#factEXIT >#80#return; 46752#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46898#$Ultimate##0 ~n := #in~n; 46896#L25 assume !(~n <= 0); 46833#L26 call #t~ret0 := fact(~n - 1);< 46893#$Ultimate##0 ~n := #in~n; 46884#L25 assume ~n <= 0;#res := 1; 46856#factFINAL assume true; 46832#factEXIT >#70#return; 46836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47590#factFINAL assume true; 47589#factEXIT >#82#return; 46749#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 46748#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 46746#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 46747#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46638#L43 [2024-10-13 16:57:45,946 INFO L747 eck$LassoCheckResult]: Loop: 46638#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 46333#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46334#$Ultimate##0 ~n := #in~n; 46740#L25 assume !(~n <= 0); 46410#L26 call #t~ret0 := fact(~n - 1);< 46411#$Ultimate##0 ~n := #in~n; 46739#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46734#$Ultimate##0 ~n := #in~n; 46739#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46734#$Ultimate##0 ~n := #in~n; 46739#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46734#$Ultimate##0 ~n := #in~n; 46739#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46734#$Ultimate##0 ~n := #in~n; 46737#L25 assume ~n <= 0;#res := 1; 46736#factFINAL assume true; 46733#factEXIT >#70#return; 46730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46727#factFINAL assume true; 46722#factEXIT >#70#return; 46721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46720#factFINAL assume true; 46718#factEXIT >#70#return; 46717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46714#factFINAL assume true; 46709#factEXIT >#70#return; 46713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46731#factFINAL assume true; 46728#factEXIT >#70#return; 46725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46724#factFINAL assume true; 46696#factEXIT >#78#return; 46693#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46694#$Ultimate##0 ~n := #in~n; 46705#L25 assume ~n <= 0;#res := 1; 46704#factFINAL assume true; 46692#factEXIT >#80#return; 46689#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46690#$Ultimate##0 ~n := #in~n; 46719#L25 assume !(~n <= 0); 46457#L26 call #t~ret0 := fact(~n - 1);< 46456#$Ultimate##0 ~n := #in~n; 46458#L25 assume !(~n <= 0); 46712#L26 call #t~ret0 := fact(~n - 1);< 46715#$Ultimate##0 ~n := #in~n; 46738#L25 assume !(~n <= 0); 46711#L26 call #t~ret0 := fact(~n - 1);< 46723#$Ultimate##0 ~n := #in~n; 46739#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46734#$Ultimate##0 ~n := #in~n; 46737#L25 assume ~n <= 0;#res := 1; 46736#factFINAL assume true; 46733#factEXIT >#70#return; 46730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46727#factFINAL assume true; 46722#factEXIT >#70#return; 46721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46720#factFINAL assume true; 46718#factEXIT >#70#return; 46717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46714#factFINAL assume true; 46709#factEXIT >#70#return; 46707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46706#factFINAL assume true; 46688#factEXIT >#82#return; 46686#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 46684#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 46661#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 46642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46638#L43 [2024-10-13 16:57:45,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 8 times [2024-10-13 16:57:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982354046] [2024-10-13 16:57:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944504959] [2024-10-13 16:57:45,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:45,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:45,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:45,962 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:45,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2024-10-13 16:57:46,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:46,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:46,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:46,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:46,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -374077700, now seen corresponding path program 12 times [2024-10-13 16:57:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566331526] [2024-10-13 16:57:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:57:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 16:57:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 16:57:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-13 16:57:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566331526] [2024-10-13 16:57:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566331526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625371465] [2024-10-13 16:57:46,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:57:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:46,504 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:46,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2024-10-13 16:57:46,592 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-10-13 16:57:46,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:46,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 16:57:46,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 58 proven. 173 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 16:57:46,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 58 proven. 209 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 16:57:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625371465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:47,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 24] total 37 [2024-10-13 16:57:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072040839] [2024-10-13 16:57:47,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:47,671 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 16:57:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 16:57:47,672 INFO L87 Difference]: Start difference. First operand 1259 states and 2155 transitions. cyclomatic complexity: 919 Second operand has 37 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 26 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (31), 22 states have call predecessors, (31), 17 states have call successors, (31) [2024-10-13 16:57:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:48,276 INFO L93 Difference]: Finished difference Result 1700 states and 3152 transitions. [2024-10-13 16:57:48,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1700 states and 3152 transitions. [2024-10-13 16:57:48,285 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 286 [2024-10-13 16:57:48,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1700 states to 1690 states and 3142 transitions. [2024-10-13 16:57:48,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 459 [2024-10-13 16:57:48,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2024-10-13 16:57:48,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1690 states and 3142 transitions. [2024-10-13 16:57:48,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:48,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1690 states and 3142 transitions. [2024-10-13 16:57:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states and 3142 transitions. [2024-10-13 16:57:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1346. [2024-10-13 16:57:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 784 states have (on average 1.1096938775510203) internal successors, (870), 773 states have internal predecessors, (870), 422 states have call successors, (422), 160 states have call predecessors, (422), 140 states have return successors, (1210), 412 states have call predecessors, (1210), 422 states have call successors, (1210) [2024-10-13 16:57:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2502 transitions. [2024-10-13 16:57:48,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1346 states and 2502 transitions. [2024-10-13 16:57:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 16:57:48,342 INFO L425 stractBuchiCegarLoop]: Abstraction has 1346 states and 2502 transitions. [2024-10-13 16:57:48,342 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-13 16:57:48,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1346 states and 2502 transitions. [2024-10-13 16:57:48,346 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 202 [2024-10-13 16:57:48,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:48,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:48,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:48,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:48,348 INFO L745 eck$LassoCheckResult]: Stem: 50083#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 50010#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 50011#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 50033#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 50084#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 50336#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50038#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 50039#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50507#$Ultimate##0 ~n := #in~n; 50510#L25 assume ~n <= 0;#res := 1; 50509#factFINAL assume true; 50506#factEXIT >#72#return; 50502#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50503#$Ultimate##0 ~n := #in~n; 50508#L25 assume ~n <= 0;#res := 1; 50505#factFINAL assume true; 50501#factEXIT >#74#return; 50498#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50499#$Ultimate##0 ~n := #in~n; 50504#L25 assume ~n <= 0;#res := 1; 50500#factFINAL assume true; 50497#factEXIT >#76#return; 50496#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50494#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 50495#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 50475#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50476#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 50467#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50468#$Ultimate##0 ~n := #in~n; 50490#L25 assume !(~n <= 0); 50491#L26 call #t~ret0 := fact(~n - 1);< 50528#$Ultimate##0 ~n := #in~n; 50519#L25 assume ~n <= 0;#res := 1; 50513#factFINAL assume true; 50514#factEXIT >#70#return; 50556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50469#factFINAL assume true; 50471#factEXIT >#78#return; 50453#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50457#$Ultimate##0 ~n := #in~n; 50538#L25 assume ~n <= 0;#res := 1; 50537#factFINAL assume true; 50452#factEXIT >#80#return; 50455#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50530#$Ultimate##0 ~n := #in~n; 50529#L25 assume !(~n <= 0); 50521#L26 call #t~ret0 := fact(~n - 1);< 50525#$Ultimate##0 ~n := #in~n; 50526#L25 assume ~n <= 0;#res := 1; 50654#factFINAL assume true; 50652#factEXIT >#70#return; 50653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51334#factFINAL assume true; 51333#factEXIT >#82#return; 50554#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50552#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 50551#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 50548#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50067#L43 [2024-10-13 16:57:48,349 INFO L747 eck$LassoCheckResult]: Loop: 50067#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 49990#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49991#$Ultimate##0 ~n := #in~n; 50389#L25 assume !(~n <= 0); 50390#L26 call #t~ret0 := fact(~n - 1);< 50426#$Ultimate##0 ~n := #in~n; 50410#L25 assume !(~n <= 0); 49999#L26 call #t~ret0 := fact(~n - 1);< 50409#$Ultimate##0 ~n := #in~n; 50410#L25 assume !(~n <= 0); 49999#L26 call #t~ret0 := fact(~n - 1);< 50409#$Ultimate##0 ~n := #in~n; 50410#L25 assume !(~n <= 0); 49999#L26 call #t~ret0 := fact(~n - 1);< 50409#$Ultimate##0 ~n := #in~n; 50410#L25 assume !(~n <= 0); 49999#L26 call #t~ret0 := fact(~n - 1);< 50409#$Ultimate##0 ~n := #in~n; 50062#L25 assume ~n <= 0;#res := 1; 50008#factFINAL assume true; 49998#factEXIT >#70#return; 50000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50436#factFINAL assume true; 50434#factEXIT >#70#return; 50433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50431#factFINAL assume true; 50428#factEXIT >#70#return; 50427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50424#factFINAL assume true; 50423#factEXIT >#70#return; 50419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50420#factFINAL assume true; 50416#factEXIT >#70#return; 50415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50414#factFINAL assume true; 50412#factEXIT >#78#return; 50078#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50079#$Ultimate##0 ~n := #in~n; 50391#L25 assume ~n <= 0;#res := 1; 50388#factFINAL assume true; 50386#factEXIT >#80#return; 50017#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50074#$Ultimate##0 ~n := #in~n; 50075#L25 assume !(~n <= 0); 50016#L26 call #t~ret0 := fact(~n - 1);< 50018#$Ultimate##0 ~n := #in~n; 50435#L25 assume !(~n <= 0); 50418#L26 call #t~ret0 := fact(~n - 1);< 50421#$Ultimate##0 ~n := #in~n; 50432#L25 assume !(~n <= 0); 50417#L26 call #t~ret0 := fact(~n - 1);< 50429#$Ultimate##0 ~n := #in~n; 50430#L25 assume !(~n <= 0); 50411#L26 call #t~ret0 := fact(~n - 1);< 50425#$Ultimate##0 ~n := #in~n; 50410#L25 assume !(~n <= 0); 49999#L26 call #t~ret0 := fact(~n - 1);< 50409#$Ultimate##0 ~n := #in~n; 50062#L25 assume ~n <= 0;#res := 1; 50008#factFINAL assume true; 49998#factEXIT >#70#return; 50000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50436#factFINAL assume true; 50434#factEXIT >#70#return; 50433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50431#factFINAL assume true; 50428#factEXIT >#70#return; 50427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50424#factFINAL assume true; 50423#factEXIT >#70#return; 50419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50420#factFINAL assume true; 50416#factEXIT >#70#return; 50415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50414#factFINAL assume true; 50412#factEXIT >#82#return; 50359#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50034#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 50035#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 50066#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50067#L43 [2024-10-13 16:57:48,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 9 times [2024-10-13 16:57:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166413126] [2024-10-13 16:57:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458291034] [2024-10-13 16:57:48,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:48,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:48,361 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:48,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2024-10-13 16:57:48,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-13 16:57:48,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:48,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:48,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1577096060, now seen corresponding path program 13 times [2024-10-13 16:57:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057046323] [2024-10-13 16:57:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:48,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102685904] [2024-10-13 16:57:48,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:57:48,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:48,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:48,489 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:48,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2024-10-13 16:57:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:48,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:48,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1824296925, now seen corresponding path program 10 times [2024-10-13 16:57:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319910208] [2024-10-13 16:57:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:57:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:57:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:57:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:57:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:57:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:57:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:57:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 16:57:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 16:57:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 128 proven. 116 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2024-10-13 16:57:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319910208] [2024-10-13 16:57:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319910208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263998475] [2024-10-13 16:57:48,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:48,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:48,828 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:48,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2024-10-13 16:57:48,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:48,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:48,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 16:57:48,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 588 proven. 25 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-13 16:57:48,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 126 proven. 122 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-10-13 16:57:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263998475] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:49,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:49,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 12] total 17 [2024-10-13 16:57:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733162619] [2024-10-13 16:57:49,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:49,574 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:49,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:49,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:49,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:49,575 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:49,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,575 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:49,575 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:49,575 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2024-10-13 16:57:49,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:49,575 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:49,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,634 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:49,634 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:49,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,636 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-13 16:57:49,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,649 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,650 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,663 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-13 16:57:49,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,676 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,676 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,689 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-13 16:57:49,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,701 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,701 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,713 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-13 16:57:49,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,725 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,725 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,737 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-13 16:57:49,740 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,740 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,750 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,750 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,762 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-10-13 16:57:49,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,781 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,782 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=6} Honda state: {ULTIMATE.start_main_~x~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,794 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-10-13 16:57:49,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,807 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,807 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-10-13 16:57:49,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,819 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-10-13 16:57:49,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-10-13 16:57:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,844 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-10-13 16:57:49,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:49,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,856 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:49,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-10-13 16:57:49,868 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:49,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:49,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:49,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:49,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:49,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,868 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:49,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:49,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2024-10-13 16:57:49,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:49,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:49,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,916 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:49,916 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:49,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,918 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-10-13 16:57:49,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:49,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:49,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:49,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:49,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:49,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,943 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-10-13 16:57:49,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:49,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:49,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:49,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:49,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:49,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-10-13 16:57:49,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,972 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-10-13 16:57:49,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:49,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:49,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:49,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:49,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:49,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,998 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-10-13 16:57:50,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:50,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:50,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:50,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:50,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:50,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:50,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:50,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:50,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:50,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-10-13 16:57:50,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,025 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-10-13 16:57:50,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:50,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:50,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:50,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:50,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:50,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:50,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:50,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:50,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:50,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,054 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-10-13 16:57:50,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:50,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:50,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:50,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:50,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:50,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:50,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:50,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:50,069 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:50,072 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:50,072 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:50,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,076 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-10-13 16:57:50,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:50,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:50,077 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:50,077 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 11 Supporting invariants [] [2024-10-13 16:57:50,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:50,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:57:50,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 16:57:50,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-13 16:57:50,579 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-13 16:57:50,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1346 states and 2502 transitions. cyclomatic complexity: 1179 Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-13 16:57:50,929 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1346 states and 2502 transitions. cyclomatic complexity: 1179. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 2607 states and 4230 transitions. Complement of second has 89 states. [2024-10-13 16:57:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-13 16:57:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 69 transitions. [2024-10-13 16:57:50,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 69 transitions. Stem has 58 letters. Loop has 80 letters. [2024-10-13 16:57:50,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 69 transitions. Stem has 138 letters. Loop has 80 letters. [2024-10-13 16:57:50,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 69 transitions. Stem has 58 letters. Loop has 160 letters. [2024-10-13 16:57:50,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2607 states and 4230 transitions. [2024-10-13 16:57:50,950 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 202 [2024-10-13 16:57:50,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2607 states to 1766 states and 3117 transitions. [2024-10-13 16:57:50,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2024-10-13 16:57:50,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2024-10-13 16:57:50,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1766 states and 3117 transitions. [2024-10-13 16:57:50,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:50,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1766 states and 3117 transitions. [2024-10-13 16:57:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states and 3117 transitions. [2024-10-13 16:57:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1608. [2024-10-13 16:57:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 954 states have (on average 1.1037735849056605) internal successors, (1053), 941 states have internal predecessors, (1053), 464 states have call successors, (464), 192 states have call predecessors, (464), 190 states have return successors, (1368), 474 states have call predecessors, (1368), 464 states have call successors, (1368) [2024-10-13 16:57:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2885 transitions. [2024-10-13 16:57:51,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1608 states and 2885 transitions. [2024-10-13 16:57:51,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 16:57:51,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-10-13 16:57:51,011 INFO L87 Difference]: Start difference. First operand 1608 states and 2885 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-13 16:57:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:51,217 INFO L93 Difference]: Finished difference Result 1960 states and 3965 transitions. [2024-10-13 16:57:51,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1960 states and 3965 transitions. [2024-10-13 16:57:51,228 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 279 [2024-10-13 16:57:51,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1960 states to 1944 states and 3941 transitions. [2024-10-13 16:57:51,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 527 [2024-10-13 16:57:51,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 527 [2024-10-13 16:57:51,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1944 states and 3941 transitions. [2024-10-13 16:57:51,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:51,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1944 states and 3941 transitions. [2024-10-13 16:57:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states and 3941 transitions. [2024-10-13 16:57:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1652. [2024-10-13 16:57:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 984 states have (on average 1.1046747967479675) internal successors, (1087), 971 states have internal predecessors, (1087), 478 states have call successors, (478), 192 states have call predecessors, (478), 190 states have return successors, (1388), 488 states have call predecessors, (1388), 478 states have call successors, (1388) [2024-10-13 16:57:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2953 transitions. [2024-10-13 16:57:51,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1652 states and 2953 transitions. [2024-10-13 16:57:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 16:57:51,286 INFO L425 stractBuchiCegarLoop]: Abstraction has 1652 states and 2953 transitions. [2024-10-13 16:57:51,286 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-13 16:57:51,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1652 states and 2953 transitions. [2024-10-13 16:57:51,291 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 210 [2024-10-13 16:57:51,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:51,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:51,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:51,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 12, 12, 12, 12, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:51,294 INFO L745 eck$LassoCheckResult]: Stem: 59312#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 59260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 59261#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 59283#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 59271#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 59273#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60354#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 59258#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 59259#$Ultimate##0 ~n := #in~n; 60380#L25 assume ~n <= 0;#res := 1; 60379#factFINAL assume true; 60377#factEXIT >#72#return; 59304#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 59305#$Ultimate##0 ~n := #in~n; 60404#L25 assume ~n <= 0;#res := 1; 60403#factFINAL assume true; 60402#factEXIT >#74#return; 59244#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59245#$Ultimate##0 ~n := #in~n; 60413#L25 assume ~n <= 0;#res := 1; 60412#factFINAL assume true; 60411#factEXIT >#76#return; 59281#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 59282#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 59294#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60458#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60456#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60448#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60450#$Ultimate##0 ~n := #in~n; 60468#L25 assume !(~n <= 0); 60465#L26 call #t~ret0 := fact(~n - 1);< 60466#$Ultimate##0 ~n := #in~n; 60469#L25 assume ~n <= 0;#res := 1; 60467#factFINAL assume true; 60464#factEXIT >#70#return; 60454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60459#factFINAL assume true; 60446#factEXIT >#78#return; 60442#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60443#$Ultimate##0 ~n := #in~n; 60457#L25 assume ~n <= 0;#res := 1; 60445#factFINAL assume true; 60440#factEXIT >#80#return; 60436#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60438#$Ultimate##0 ~n := #in~n; 60472#L25 assume !(~n <= 0); 60453#L26 call #t~ret0 := fact(~n - 1);< 60455#$Ultimate##0 ~n := #in~n; 60471#L25 assume ~n <= 0;#res := 1; 60461#factFINAL assume true; 60451#factEXIT >#70#return; 60444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60439#factFINAL assume true; 60434#factEXIT >#82#return; 60433#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 60432#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 60431#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59570#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 59569#L42-4 havoc main_~k~0#1; 59278#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 59279#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 59553#L42-3 [2024-10-13 16:57:51,294 INFO L747 eck$LassoCheckResult]: Loop: 59553#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 59552#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 59362#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 59393#$Ultimate##0 ~n := #in~n; 59550#L25 assume !(~n <= 0); 59400#L26 call #t~ret0 := fact(~n - 1);< 59522#$Ultimate##0 ~n := #in~n; 59523#L25 assume !(~n <= 0); 59493#L26 call #t~ret0 := fact(~n - 1);< 59526#$Ultimate##0 ~n := #in~n; 59523#L25 assume !(~n <= 0); 59493#L26 call #t~ret0 := fact(~n - 1);< 59526#$Ultimate##0 ~n := #in~n; 59523#L25 assume !(~n <= 0); 59493#L26 call #t~ret0 := fact(~n - 1);< 59526#$Ultimate##0 ~n := #in~n; 59523#L25 assume !(~n <= 0); 59493#L26 call #t~ret0 := fact(~n - 1);< 59526#$Ultimate##0 ~n := #in~n; 59529#L25 assume ~n <= 0;#res := 1; 59527#factFINAL assume true; 59525#factEXIT >#70#return; 59524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59521#factFINAL assume true; 59514#factEXIT >#70#return; 59509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59501#factFINAL assume true; 59490#factEXIT >#70#return; 59498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59566#factFINAL assume true; 59562#factEXIT >#70#return; 59564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59573#factFINAL assume true; 59568#factEXIT >#70#return; 59567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59555#factFINAL assume true; 59543#factEXIT >#72#return; 59531#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 59541#$Ultimate##0 ~n := #in~n; 59549#L25 assume ~n <= 0;#res := 1; 59433#factFINAL assume true; 59530#factEXIT >#74#return; 59511#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59520#$Ultimate##0 ~n := #in~n; 59518#L25 assume !(~n <= 0); 59408#L26 call #t~ret0 := fact(~n - 1);< 59508#$Ultimate##0 ~n := #in~n; 59506#L25 assume !(~n <= 0); 59407#L26 call #t~ret0 := fact(~n - 1);< 59410#$Ultimate##0 ~n := #in~n; 59411#L25 assume !(~n <= 0); 59414#L26 call #t~ret0 := fact(~n - 1);< 59505#$Ultimate##0 ~n := #in~n; 59528#L25 assume !(~n <= 0); 59494#L26 call #t~ret0 := fact(~n - 1);< 59516#$Ultimate##0 ~n := #in~n; 59523#L25 assume !(~n <= 0); 59493#L26 call #t~ret0 := fact(~n - 1);< 59526#$Ultimate##0 ~n := #in~n; 59529#L25 assume ~n <= 0;#res := 1; 59527#factFINAL assume true; 59525#factEXIT >#70#return; 59524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59521#factFINAL assume true; 59514#factEXIT >#70#return; 59509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59501#factFINAL assume true; 59490#factEXIT >#70#return; 59498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59566#factFINAL assume true; 59562#factEXIT >#70#return; 59564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59573#factFINAL assume true; 59568#factEXIT >#70#return; 59567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59555#factFINAL assume true; 59543#factEXIT >#76#return; 59388#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 59618#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 59617#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59616#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 59615#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 59338#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 59393#$Ultimate##0 ~n := #in~n; 59550#L25 assume !(~n <= 0); 59400#L26 call #t~ret0 := fact(~n - 1);< 59522#$Ultimate##0 ~n := #in~n; 59457#L25 assume ~n <= 0;#res := 1; 59404#factFINAL assume true; 59397#factEXIT >#70#return; 59402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59594#factFINAL assume true; 59328#factEXIT >#78#return; 59376#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 59541#$Ultimate##0 ~n := #in~n; 59549#L25 assume ~n <= 0;#res := 1; 59433#factFINAL assume true; 59530#factEXIT >#80#return; 59363#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59390#$Ultimate##0 ~n := #in~n; 59601#L25 assume !(~n <= 0); 59400#L26 call #t~ret0 := fact(~n - 1);< 59522#$Ultimate##0 ~n := #in~n; 59457#L25 assume ~n <= 0;#res := 1; 59404#factFINAL assume true; 59397#factEXIT >#70#return; 59402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59594#factFINAL assume true; 59328#factEXIT >#82#return; 59387#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 59596#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 59576#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59320#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 59317#L42-4 havoc main_~k~0#1; 59276#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 59277#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 59553#L42-3 [2024-10-13 16:57:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 1 times [2024-10-13 16:57:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266865956] [2024-10-13 16:57:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401541025] [2024-10-13 16:57:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:51,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,304 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2024-10-13 16:57:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:51,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:51,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:51,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1491914649, now seen corresponding path program 1 times [2024-10-13 16:57:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811064408] [2024-10-13 16:57:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 16:57:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 16:57:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 16:57:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 16:57:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 16:57:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 34 proven. 91 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-13 16:57:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811064408] [2024-10-13 16:57:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811064408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368000594] [2024-10-13 16:57:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,613 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2024-10-13 16:57:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 348 proven. 182 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-10-13 16:57:51,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 48 proven. 308 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-13 16:57:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368000594] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:52,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 18] total 29 [2024-10-13 16:57:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080432660] [2024-10-13 16:57:52,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:52,405 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:52,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 16:57:52,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-10-13 16:57:52,406 INFO L87 Difference]: Start difference. First operand 1652 states and 2953 transitions. cyclomatic complexity: 1328 Second operand has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 25 states have internal predecessors, (63), 18 states have call successors, (24), 2 states have call predecessors, (24), 8 states have return successors, (27), 14 states have call predecessors, (27), 18 states have call successors, (27) [2024-10-13 16:57:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:53,114 INFO L93 Difference]: Finished difference Result 2046 states and 3755 transitions. [2024-10-13 16:57:53,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2046 states and 3755 transitions. [2024-10-13 16:57:53,124 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 307 [2024-10-13 16:57:53,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2046 states to 2038 states and 3747 transitions. [2024-10-13 16:57:53,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2024-10-13 16:57:53,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2024-10-13 16:57:53,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2038 states and 3747 transitions. [2024-10-13 16:57:53,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:53,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2038 states and 3747 transitions. [2024-10-13 16:57:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states and 3747 transitions. [2024-10-13 16:57:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1668. [2024-10-13 16:57:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1014 states have (on average 1.0917159763313609) internal successors, (1107), 993 states have internal predecessors, (1107), 464 states have call successors, (464), 192 states have call predecessors, (464), 190 states have return successors, (1432), 482 states have call predecessors, (1432), 464 states have call successors, (1432) [2024-10-13 16:57:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 3003 transitions. [2024-10-13 16:57:53,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1668 states and 3003 transitions. [2024-10-13 16:57:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 16:57:53,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 1668 states and 3003 transitions. [2024-10-13 16:57:53,205 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-13 16:57:53,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1668 states and 3003 transitions. [2024-10-13 16:57:53,211 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 221 [2024-10-13 16:57:53,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:53,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:53,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:53,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 15, 15, 15, 15, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:53,213 INFO L745 eck$LassoCheckResult]: Stem: 63975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 63910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 63911#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 63935#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 63922#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63924#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65074#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 63903#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63904#$Ultimate##0 ~n := #in~n; 65121#L25 assume ~n <= 0;#res := 1; 65120#factFINAL assume true; 65119#factEXIT >#72#return; 63964#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63965#$Ultimate##0 ~n := #in~n; 65094#L25 assume ~n <= 0;#res := 1; 65093#factFINAL assume true; 65092#factEXIT >#74#return; 63899#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63900#$Ultimate##0 ~n := #in~n; 65127#L25 assume ~n <= 0;#res := 1; 65126#factFINAL assume true; 65125#factEXIT >#76#return; 65124#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 63945#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 63946#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65287#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65285#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 65242#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65243#$Ultimate##0 ~n := #in~n; 65252#L25 assume !(~n <= 0); 65250#L26 call #t~ret0 := fact(~n - 1);< 65251#$Ultimate##0 ~n := #in~n; 65254#L25 assume ~n <= 0;#res := 1; 65253#factFINAL assume true; 65249#factEXIT >#70#return; 65229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65246#factFINAL assume true; 65241#factEXIT >#78#return; 65217#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65219#$Ultimate##0 ~n := #in~n; 65231#L25 assume ~n <= 0;#res := 1; 65225#factFINAL assume true; 65216#factEXIT >#80#return; 63907#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 65213#$Ultimate##0 ~n := #in~n; 65232#L25 assume !(~n <= 0); 65227#L26 call #t~ret0 := fact(~n - 1);< 65230#$Ultimate##0 ~n := #in~n; 65258#L25 assume ~n <= 0;#res := 1; 65233#factFINAL assume true; 65226#factEXIT >#70#return; 65224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65215#factFINAL assume true; 65211#factEXIT >#82#return; 65208#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 65200#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 65198#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63987#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63988#L42-4 havoc main_~k~0#1; 63933#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 63934#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 64093#L42-3 [2024-10-13 16:57:53,213 INFO L747 eck$LassoCheckResult]: Loop: 64093#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64092#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 64000#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64049#$Ultimate##0 ~n := #in~n; 64263#L25 assume !(~n <= 0); 64060#L26 call #t~ret0 := fact(~n - 1);< 64213#$Ultimate##0 ~n := #in~n; 64200#L25 assume ~n <= 0;#res := 1; 64217#factFINAL assume true; 64209#factEXIT >#70#return; 64208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64206#factFINAL assume true; 64101#factEXIT >#72#return; 64032#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64090#$Ultimate##0 ~n := #in~n; 64091#L25 assume ~n <= 0;#res := 1; 64089#factFINAL assume true; 64080#factEXIT >#74#return; 63991#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64159#$Ultimate##0 ~n := #in~n; 64262#L25 assume !(~n <= 0); 64060#L26 call #t~ret0 := fact(~n - 1);< 64213#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64201#L25 assume ~n <= 0;#res := 1; 64197#factFINAL assume true; 64183#factEXIT >#70#return; 64177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64172#factFINAL assume true; 64164#factEXIT >#70#return; 64168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64187#factFINAL assume true; 64178#factEXIT >#70#return; 64176#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64170#factFINAL assume true; 64163#factEXIT >#76#return; 64029#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 64274#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 64273#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64272#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64271#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 64025#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64049#$Ultimate##0 ~n := #in~n; 64263#L25 assume !(~n <= 0); 64060#L26 call #t~ret0 := fact(~n - 1);< 64213#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64201#L25 assume ~n <= 0;#res := 1; 64197#factFINAL assume true; 64183#factEXIT >#70#return; 64177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64172#factFINAL assume true; 64164#factEXIT >#70#return; 64168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64187#factFINAL assume true; 64178#factEXIT >#70#return; 64179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64282#factFINAL assume true; 64280#factEXIT >#70#return; 64070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64075#factFINAL assume true; 64057#factEXIT >#70#return; 64056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64040#factFINAL assume true; 64047#factEXIT >#72#return; 63995#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64049#$Ultimate##0 ~n := #in~n; 64263#L25 assume !(~n <= 0); 64060#L26 call #t~ret0 := fact(~n - 1);< 64213#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64201#L25 assume ~n <= 0;#res := 1; 64197#factFINAL assume true; 64183#factEXIT >#70#return; 64177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64172#factFINAL assume true; 64164#factEXIT >#70#return; 64168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64187#factFINAL assume true; 64178#factEXIT >#70#return; 64176#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64170#factFINAL assume true; 64163#factEXIT >#74#return; 64019#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64049#$Ultimate##0 ~n := #in~n; 64263#L25 assume ~n <= 0;#res := 1; 64089#factFINAL assume true; 64080#factEXIT >#76#return; 64086#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 64104#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 64103#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64051#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64050#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 64004#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64049#$Ultimate##0 ~n := #in~n; 64263#L25 assume !(~n <= 0); 64060#L26 call #t~ret0 := fact(~n - 1);< 64213#$Ultimate##0 ~n := #in~n; 64198#L25 assume !(~n <= 0); 64065#L26 call #t~ret0 := fact(~n - 1);< 64185#$Ultimate##0 ~n := #in~n; 64201#L25 assume ~n <= 0;#res := 1; 64197#factFINAL assume true; 64183#factEXIT >#70#return; 64177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64172#factFINAL assume true; 64164#factEXIT >#70#return; 64162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64161#factFINAL assume true; 63990#factEXIT >#78#return; 64034#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64088#$Ultimate##0 ~n := #in~n; 64215#L25 assume ~n <= 0;#res := 1; 64089#factFINAL assume true; 64080#factEXIT >#80#return; 64006#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64159#$Ultimate##0 ~n := #in~n; 64262#L25 assume !(~n <= 0); 64060#L26 call #t~ret0 := fact(~n - 1);< 64213#$Ultimate##0 ~n := #in~n; 64200#L25 assume ~n <= 0;#res := 1; 64217#factFINAL assume true; 64209#factEXIT >#70#return; 64208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64206#factFINAL assume true; 64101#factEXIT >#82#return; 63986#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 63985#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 63984#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63982#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63979#L42-4 havoc main_~k~0#1; 63931#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 63932#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 64093#L42-3 [2024-10-13 16:57:53,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 2 times [2024-10-13 16:57:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:53,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080258688] [2024-10-13 16:57:53,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622558033] [2024-10-13 16:57:53,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:53,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:53,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,229 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2024-10-13 16:57:53,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:53,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:53,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:53,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:53,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1810962576, now seen corresponding path program 2 times [2024-10-13 16:57:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709887312] [2024-10-13 16:57:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 16:57:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:57:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 16:57:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 16:57:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 16:57:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 16:57:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 96 proven. 168 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-13 16:57:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709887312] [2024-10-13 16:57:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709887312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743992516] [2024-10-13 16:57:53,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:53,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:53,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,568 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2024-10-13 16:57:53,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:53,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:53,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 761 proven. 100 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-10-13 16:57:53,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 81 proven. 270 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-10-13 16:57:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743992516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:54,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 23 [2024-10-13 16:57:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015742213] [2024-10-13 16:57:54,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:54,119 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 16:57:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-10-13 16:57:54,119 INFO L87 Difference]: Start difference. First operand 1668 states and 3003 transitions. cyclomatic complexity: 1362 Second operand has 23 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 22 states have internal predecessors, (62), 15 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (30), 11 states have call predecessors, (30), 15 states have call successors, (30) [2024-10-13 16:57:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:54,641 INFO L93 Difference]: Finished difference Result 1944 states and 3529 transitions. [2024-10-13 16:57:54,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1944 states and 3529 transitions. [2024-10-13 16:57:54,651 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2024-10-13 16:57:54,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1944 states to 1942 states and 3527 transitions. [2024-10-13 16:57:54,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2024-10-13 16:57:54,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2024-10-13 16:57:54,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1942 states and 3527 transitions. [2024-10-13 16:57:54,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:54,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1942 states and 3527 transitions. [2024-10-13 16:57:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states and 3527 transitions. [2024-10-13 16:57:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1746. [2024-10-13 16:57:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1074 states have (on average 1.095903165735568) internal successors, (1177), 1053 states have internal predecessors, (1177), 482 states have call successors, (482), 192 states have call predecessors, (482), 190 states have return successors, (1404), 500 states have call predecessors, (1404), 482 states have call successors, (1404) [2024-10-13 16:57:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 3063 transitions. [2024-10-13 16:57:54,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1746 states and 3063 transitions. [2024-10-13 16:57:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 16:57:54,704 INFO L425 stractBuchiCegarLoop]: Abstraction has 1746 states and 3063 transitions. [2024-10-13 16:57:54,704 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-13 16:57:54,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1746 states and 3063 transitions. [2024-10-13 16:57:54,709 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 260 [2024-10-13 16:57:54,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:54,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:54,710 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:54,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:54,710 INFO L745 eck$LassoCheckResult]: Stem: 68866#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 68808#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 68809#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 68832#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 68819#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 68821#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69910#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 68802#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68803#$Ultimate##0 ~n := #in~n; 70048#L25 assume ~n <= 0;#res := 1; 70047#factFINAL assume true; 70044#factEXIT >#72#return; 68850#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68851#$Ultimate##0 ~n := #in~n; 70041#L25 assume ~n <= 0;#res := 1; 70040#factFINAL assume true; 70039#factEXIT >#74#return; 68799#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68800#$Ultimate##0 ~n := #in~n; 70075#L25 assume ~n <= 0;#res := 1; 70074#factFINAL assume true; 70073#factEXIT >#76#return; 68826#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 68827#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 68841#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 70120#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70115#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70103#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70105#$Ultimate##0 ~n := #in~n; 70121#L25 assume !(~n <= 0); 70118#L26 call #t~ret0 := fact(~n - 1);< 70119#$Ultimate##0 ~n := #in~n; 70127#L25 assume ~n <= 0;#res := 1; 70126#factFINAL assume true; 70117#factEXIT >#70#return; 70109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70113#factFINAL assume true; 70101#factEXIT >#78#return; 70097#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70098#$Ultimate##0 ~n := #in~n; 70111#L25 assume ~n <= 0;#res := 1; 70100#factFINAL assume true; 70095#factEXIT >#80#return; 70091#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70093#$Ultimate##0 ~n := #in~n; 70112#L25 assume !(~n <= 0); 70107#L26 call #t~ret0 := fact(~n - 1);< 70110#$Ultimate##0 ~n := #in~n; 70122#L25 assume ~n <= 0;#res := 1; 70116#factFINAL assume true; 70106#factEXIT >#70#return; 70099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70094#factFINAL assume true; 70089#factEXIT >#82#return; 70088#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 70087#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 70086#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 69145#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 69143#L42-4 havoc main_~k~0#1; 68830#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 68831#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69133#L42-3 [2024-10-13 16:57:54,710 INFO L747 eck$LassoCheckResult]: Loop: 69133#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69130#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 68883#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68960#$Ultimate##0 ~n := #in~n; 69129#L25 assume !(~n <= 0); 68967#L26 call #t~ret0 := fact(~n - 1);< 69091#$Ultimate##0 ~n := #in~n; 68987#L25 assume ~n <= 0;#res := 1; 68970#factFINAL assume true; 68964#factEXIT >#70#return; 68963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68959#factFINAL assume true; 68880#factEXIT >#72#return; 68944#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69125#$Ultimate##0 ~n := #in~n; 69128#L25 assume ~n <= 0;#res := 1; 69000#factFINAL assume true; 69109#factEXIT >#74#return; 68854#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68852#$Ultimate##0 ~n := #in~n; 68859#L25 assume !(~n <= 0); 68967#L26 call #t~ret0 := fact(~n - 1);< 69091#$Ultimate##0 ~n := #in~n; 68987#L25 assume ~n <= 0;#res := 1; 68970#factFINAL assume true; 68964#factEXIT >#70#return; 68963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68959#factFINAL assume true; 68880#factEXIT >#76#return; 68956#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69253#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 69251#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 69248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69245#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 68911#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68961#$Ultimate##0 ~n := #in~n; 69190#L25 assume !(~n <= 0); 68965#L26 call #t~ret0 := fact(~n - 1);< 68969#$Ultimate##0 ~n := #in~n; 68987#L25 assume ~n <= 0;#res := 1; 68970#factFINAL assume true; 68964#factEXIT >#70#return; 68963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68959#factFINAL assume true; 68880#factEXIT >#72#return; 68906#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68960#$Ultimate##0 ~n := #in~n; 69129#L25 assume !(~n <= 0); 68967#L26 call #t~ret0 := fact(~n - 1);< 69091#$Ultimate##0 ~n := #in~n; 69095#L25 assume !(~n <= 0); 69065#L26 call #t~ret0 := fact(~n - 1);< 69098#$Ultimate##0 ~n := #in~n; 69095#L25 assume !(~n <= 0); 69065#L26 call #t~ret0 := fact(~n - 1);< 69098#$Ultimate##0 ~n := #in~n; 69095#L25 assume !(~n <= 0); 69065#L26 call #t~ret0 := fact(~n - 1);< 69098#$Ultimate##0 ~n := #in~n; 69105#L25 assume ~n <= 0;#res := 1; 69101#factFINAL assume true; 69097#factEXIT >#70#return; 69092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69089#factFINAL assume true; 69086#factEXIT >#70#return; 69085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69072#factFINAL assume true; 69061#factEXIT >#70#return; 69068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69151#factFINAL assume true; 69147#factEXIT >#70#return; 69149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69188#factFINAL assume true; 69189#factEXIT >#74#return; 68893#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68961#$Ultimate##0 ~n := #in~n; 69190#L25 assume ~n <= 0;#res := 1; 69000#factFINAL assume true; 69109#factEXIT >#76#return; 69116#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69235#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 69234#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 69232#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69231#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 68912#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68960#$Ultimate##0 ~n := #in~n; 69129#L25 assume !(~n <= 0); 68967#L26 call #t~ret0 := fact(~n - 1);< 69091#$Ultimate##0 ~n := #in~n; 69095#L25 assume !(~n <= 0); 69065#L26 call #t~ret0 := fact(~n - 1);< 69098#$Ultimate##0 ~n := #in~n; 69105#L25 assume ~n <= 0;#res := 1; 69101#factFINAL assume true; 69097#factEXIT >#70#return; 69092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69089#factFINAL assume true; 69086#factEXIT >#70#return; 69087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69218#factFINAL assume true; 69176#factEXIT >#78#return; 68901#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68961#$Ultimate##0 ~n := #in~n; 69190#L25 assume !(~n <= 0); 68965#L26 call #t~ret0 := fact(~n - 1);< 68969#$Ultimate##0 ~n := #in~n; 68987#L25 assume ~n <= 0;#res := 1; 68970#factFINAL assume true; 68964#factEXIT >#70#return; 68963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68959#factFINAL assume true; 68880#factEXIT >#80#return; 68855#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68852#$Ultimate##0 ~n := #in~n; 68859#L25 assume !(~n <= 0); 68967#L26 call #t~ret0 := fact(~n - 1);< 69091#$Ultimate##0 ~n := #in~n; 68987#L25 assume ~n <= 0;#res := 1; 68970#factFINAL assume true; 68964#factEXIT >#70#return; 68963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68959#factFINAL assume true; 68880#factEXIT >#82#return; 68877#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 68876#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 68875#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 68873#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 68870#L42-4 havoc main_~k~0#1; 68828#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 68829#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69133#L42-3 [2024-10-13 16:57:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 3 times [2024-10-13 16:57:54,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224001796] [2024-10-13 16:57:54,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:54,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098629695] [2024-10-13 16:57:54,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:54,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:54,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:54,721 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:54,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2024-10-13 16:57:54,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-13 16:57:54,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:54,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:54,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1602540624, now seen corresponding path program 3 times [2024-10-13 16:57:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099131774] [2024-10-13 16:57:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 16:57:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 16:57:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 16:57:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 16:57:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 16:57:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 16:57:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 71 proven. 252 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2024-10-13 16:57:55,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099131774] [2024-10-13 16:57:55,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099131774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642260996] [2024-10-13 16:57:55,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:57:55,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:55,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,095 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2024-10-13 16:57:55,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-13 16:57:55,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:55,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:57:55,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 315 proven. 141 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-10-13 16:57:55,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 315 proven. 154 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-10-13 16:57:56,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642260996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:56,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:56,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 19] total 35 [2024-10-13 16:57:56,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590079883] [2024-10-13 16:57:56,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:56,162 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:56,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:56,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 16:57:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 16:57:56,163 INFO L87 Difference]: Start difference. First operand 1746 states and 3063 transitions. cyclomatic complexity: 1344 Second operand has 35 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 30 states have internal predecessors, (75), 22 states have call successors, (34), 1 states have call predecessors, (34), 7 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2024-10-13 16:57:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:57,803 INFO L93 Difference]: Finished difference Result 2978 states and 5516 transitions. [2024-10-13 16:57:57,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2978 states and 5516 transitions. [2024-10-13 16:57:57,820 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 624 [2024-10-13 16:57:57,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2978 states to 2914 states and 5416 transitions. [2024-10-13 16:57:57,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 970 [2024-10-13 16:57:57,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 970 [2024-10-13 16:57:57,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2914 states and 5416 transitions. [2024-10-13 16:57:57,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:57,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2914 states and 5416 transitions. [2024-10-13 16:57:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states and 5416 transitions. [2024-10-13 16:57:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2318. [2024-10-13 16:57:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 1354 states have (on average 1.1004431314623337) internal successors, (1490), 1337 states have internal predecessors, (1490), 774 states have call successors, (774), 192 states have call predecessors, (774), 190 states have return successors, (2234), 788 states have call predecessors, (2234), 774 states have call successors, (2234) [2024-10-13 16:57:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 4498 transitions. [2024-10-13 16:57:57,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2318 states and 4498 transitions. [2024-10-13 16:57:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-10-13 16:57:57,903 INFO L425 stractBuchiCegarLoop]: Abstraction has 2318 states and 4498 transitions. [2024-10-13 16:57:57,903 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-13 16:57:57,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2318 states and 4498 transitions. [2024-10-13 16:57:57,910 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 487 [2024-10-13 16:57:57,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:57,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:57,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:57,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:57,911 INFO L745 eck$LassoCheckResult]: Stem: 74758#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 74653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 74654#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 74680#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 74667#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74668#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76373#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74646#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74647#$Ultimate##0 ~n := #in~n; 76434#L25 assume ~n <= 0;#res := 1; 76433#factFINAL assume true; 76431#factEXIT >#72#return; 74745#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74746#$Ultimate##0 ~n := #in~n; 76468#L25 assume ~n <= 0;#res := 1; 76462#factFINAL assume true; 76456#factEXIT >#74#return; 74580#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74581#$Ultimate##0 ~n := #in~n; 76513#L25 assume ~n <= 0;#res := 1; 76512#factFINAL assume true; 76509#factEXIT >#76#return; 76506#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76501#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 76495#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 76492#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76488#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76464#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76467#$Ultimate##0 ~n := #in~n; 76508#L25 assume !(~n <= 0); 76485#L26 call #t~ret0 := fact(~n - 1);< 76486#$Ultimate##0 ~n := #in~n; 76491#L25 assume ~n <= 0;#res := 1; 76487#factFINAL assume true; 76484#factEXIT >#70#return; 76473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76483#factFINAL assume true; 76463#factEXIT >#78#return; 76460#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76461#$Ultimate##0 ~n := #in~n; 76477#L25 assume ~n <= 0;#res := 1; 76476#factFINAL assume true; 76458#factEXIT >#80#return; 76452#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76455#$Ultimate##0 ~n := #in~n; 76475#L25 assume !(~n <= 0); 76471#L26 call #t~ret0 := fact(~n - 1);< 76474#$Ultimate##0 ~n := #in~n; 76489#L25 assume ~n <= 0;#res := 1; 76478#factFINAL assume true; 76470#factEXIT >#70#return; 76469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76457#factFINAL assume true; 76451#factEXIT >#82#return; 76450#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76449#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 76448#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 74765#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74766#L42-4 havoc main_~k~0#1; 74678#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 74679#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75147#L42-3 [2024-10-13 16:57:57,912 INFO L747 eck$LassoCheckResult]: Loop: 75147#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75145#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 75027#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75081#$Ultimate##0 ~n := #in~n; 75083#L25 assume !(~n <= 0); 74779#L26 call #t~ret0 := fact(~n - 1);< 74813#$Ultimate##0 ~n := #in~n; 74818#L25 assume ~n <= 0;#res := 1; 74817#factFINAL assume true; 74774#factEXIT >#70#return; 74782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75085#factFINAL assume true; 74962#factEXIT >#72#return; 75053#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75070#$Ultimate##0 ~n := #in~n; 75082#L25 assume ~n <= 0;#res := 1; 75071#factFINAL assume true; 75078#factEXIT >#74#return; 74924#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75087#$Ultimate##0 ~n := #in~n; 74912#L25 assume !(~n <= 0); 74779#L26 call #t~ret0 := fact(~n - 1);< 74813#$Ultimate##0 ~n := #in~n; 74818#L25 assume ~n <= 0;#res := 1; 74817#factFINAL assume true; 74774#factEXIT >#70#return; 74782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75085#factFINAL assume true; 74962#factEXIT >#76#return; 75059#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 75214#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 75212#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 75210#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75208#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74981#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75080#$Ultimate##0 ~n := #in~n; 75084#L25 assume !(~n <= 0); 74777#L26 call #t~ret0 := fact(~n - 1);< 74809#$Ultimate##0 ~n := #in~n; 74818#L25 assume ~n <= 0;#res := 1; 74817#factFINAL assume true; 74774#factEXIT >#70#return; 74782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75085#factFINAL assume true; 74962#factEXIT >#72#return; 75012#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75080#$Ultimate##0 ~n := #in~n; 75084#L25 assume !(~n <= 0); 74777#L26 call #t~ret0 := fact(~n - 1);< 74809#$Ultimate##0 ~n := #in~n; 74818#L25 assume ~n <= 0;#res := 1; 74817#factFINAL assume true; 74774#factEXIT >#70#return; 74782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75085#factFINAL assume true; 74962#factEXIT >#74#return; 75001#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75081#$Ultimate##0 ~n := #in~n; 75083#L25 assume ~n <= 0;#res := 1; 75071#factFINAL assume true; 75078#factEXIT >#76#return; 75129#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 75206#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 75204#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 75202#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75200#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 75007#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75081#$Ultimate##0 ~n := #in~n; 75083#L25 assume !(~n <= 0); 74779#L26 call #t~ret0 := fact(~n - 1);< 74813#$Ultimate##0 ~n := #in~n; 74818#L25 assume ~n <= 0;#res := 1; 74817#factFINAL assume true; 74774#factEXIT >#70#return; 74782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75085#factFINAL assume true; 74962#factEXIT >#78#return; 75055#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75070#$Ultimate##0 ~n := #in~n; 75082#L25 assume ~n <= 0;#res := 1; 75071#factFINAL assume true; 75078#factEXIT >#80#return; 74914#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75087#$Ultimate##0 ~n := #in~n; 74912#L25 assume !(~n <= 0); 74779#L26 call #t~ret0 := fact(~n - 1);< 74813#$Ultimate##0 ~n := #in~n; 74818#L25 assume ~n <= 0;#res := 1; 74817#factFINAL assume true; 74774#factEXIT >#70#return; 74782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75085#factFINAL assume true; 74962#factEXIT >#82#return; 75045#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 75310#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 75308#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 75305#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74760#L42-4 havoc main_~k~0#1; 74676#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 74677#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75147#L42-3 [2024-10-13 16:57:57,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 4 times [2024-10-13 16:57:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003609664] [2024-10-13 16:57:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241540395] [2024-10-13 16:57:57,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:57,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:57,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:57,924 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:57,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2024-10-13 16:57:58,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:58,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:58,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:58,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 255878608, now seen corresponding path program 4 times [2024-10-13 16:57:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111400888] [2024-10-13 16:57:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 16:57:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 16:57:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 16:57:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 16:57:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 16:57:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 16:57:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 16:57:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 16:57:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 44 proven. 56 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-13 16:57:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111400888] [2024-10-13 16:57:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111400888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780464130] [2024-10-13 16:57:58,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:58,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:58,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:58,186 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:58,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2024-10-13 16:57:58,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:58,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:58,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 16:57:58,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 230 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-13 16:57:58,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 79 proven. 134 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-10-13 16:57:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780464130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:58,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 23 [2024-10-13 16:57:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612340343] [2024-10-13 16:57:58,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:58,644 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 16:57:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-10-13 16:57:58,645 INFO L87 Difference]: Start difference. First operand 2318 states and 4498 transitions. cyclomatic complexity: 2208 Second operand has 23 states, 16 states have (on average 3.5625) internal successors, (57), 21 states have internal predecessors, (57), 15 states have call successors, (26), 2 states have call predecessors, (26), 5 states have return successors, (26), 11 states have call predecessors, (26), 15 states have call successors, (26) [2024-10-13 16:57:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:59,102 INFO L93 Difference]: Finished difference Result 2279 states and 4166 transitions. [2024-10-13 16:57:59,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2279 states and 4166 transitions. [2024-10-13 16:57:59,114 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 406 [2024-10-13 16:57:59,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2279 states to 1756 states and 2976 transitions. [2024-10-13 16:57:59,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 645 [2024-10-13 16:57:59,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2024-10-13 16:57:59,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1756 states and 2976 transitions. [2024-10-13 16:57:59,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:59,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1756 states and 2976 transitions. [2024-10-13 16:57:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states and 2976 transitions. [2024-10-13 16:57:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1668. [2024-10-13 16:57:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1035 states have (on average 1.0801932367149758) internal successors, (1118), 1017 states have internal predecessors, (1118), 448 states have call successors, (448), 183 states have call predecessors, (448), 185 states have return successors, (1196), 467 states have call predecessors, (1196), 448 states have call successors, (1196) [2024-10-13 16:57:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2762 transitions. [2024-10-13 16:57:59,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1668 states and 2762 transitions. [2024-10-13 16:57:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 16:57:59,162 INFO L425 stractBuchiCegarLoop]: Abstraction has 1668 states and 2762 transitions. [2024-10-13 16:57:59,162 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-13 16:57:59,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1668 states and 2762 transitions. [2024-10-13 16:57:59,166 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 353 [2024-10-13 16:57:59,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:59,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:59,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:59,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:59,169 INFO L745 eck$LassoCheckResult]: Stem: 80109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 80059#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 80060#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 80082#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 80110#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80219#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 80123#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80168#$Ultimate##0 ~n := #in~n; 80422#L25 assume ~n <= 0;#res := 1; 80421#factFINAL assume true; 80122#factEXIT >#72#return; 80124#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80419#$Ultimate##0 ~n := #in~n; 80420#L25 assume ~n <= 0;#res := 1; 80217#factFINAL assume true; 80218#factEXIT >#74#return; 80417#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80418#$Ultimate##0 ~n := #in~n; 80424#L25 assume ~n <= 0;#res := 1; 80423#factFINAL assume true; 80416#factEXIT >#76#return; 80078#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 80079#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 80387#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 80385#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80384#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 80382#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80383#$Ultimate##0 ~n := #in~n; 80434#L25 assume !(~n <= 0); 80404#L26 call #t~ret0 := fact(~n - 1);< 80432#$Ultimate##0 ~n := #in~n; 80446#L25 assume ~n <= 0;#res := 1; 80445#factFINAL assume true; 80431#factEXIT >#70#return; 80430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80426#factFINAL assume true; 80381#factEXIT >#78#return; 80377#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80379#$Ultimate##0 ~n := #in~n; 80399#L25 assume ~n <= 0;#res := 1; 80394#factFINAL assume true; 80376#factEXIT >#80#return; 80368#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80371#$Ultimate##0 ~n := #in~n; 80452#L25 assume !(~n <= 0); 80392#L26 call #t~ret0 := fact(~n - 1);< 80393#$Ultimate##0 ~n := #in~n; 80409#L25 assume ~n <= 0;#res := 1; 80402#factFINAL assume true; 80390#factEXIT >#70#return; 80389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80374#factFINAL assume true; 80367#factEXIT >#82#return; 80364#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 80363#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 80359#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 80115#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 80114#L42-4 havoc main_~k~0#1; 80081#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 80073#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80074#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80882#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 80017#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80880#$Ultimate##0 ~n := #in~n; 80920#L25 assume !(~n <= 0); 79925#L26 call #t~ret0 := fact(~n - 1);< 80974#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#72#return; 80865#L30-1 [2024-10-13 16:57:59,169 INFO L747 eck$LassoCheckResult]: Loop: 80865#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80931#$Ultimate##0 ~n := #in~n; 80915#L25 assume ~n <= 0;#res := 1; 80898#factFINAL assume true; 80849#factEXIT >#74#return; 79960#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80944#$Ultimate##0 ~n := #in~n; 81019#L25 assume !(~n <= 0); 79925#L26 call #t~ret0 := fact(~n - 1);< 80974#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#76#return; 80956#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 80988#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 80987#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 80986#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80945#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 80906#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80962#$Ultimate##0 ~n := #in~n; 81012#L25 assume !(~n <= 0); 80885#L26 call #t~ret0 := fact(~n - 1);< 80889#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#72#return; 80855#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80899#$Ultimate##0 ~n := #in~n; 81011#L25 assume !(~n <= 0); 80885#L26 call #t~ret0 := fact(~n - 1);< 80889#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#74#return; 79947#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80880#$Ultimate##0 ~n := #in~n; 80920#L25 assume ~n <= 0;#res := 1; 80898#factFINAL assume true; 80849#factEXIT >#76#return; 80874#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 81099#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 81098#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 81097#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81096#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 79966#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80944#$Ultimate##0 ~n := #in~n; 81019#L25 assume !(~n <= 0); 79925#L26 call #t~ret0 := fact(~n - 1);< 80974#$Ultimate##0 ~n := #in~n; 81050#L25 assume !(~n <= 0); 79926#L26 call #t~ret0 := fact(~n - 1);< 81029#$Ultimate##0 ~n := #in~n; 81049#L25 assume ~n <= 0;#res := 1; 81048#factFINAL assume true; 81027#factEXIT >#70#return; 81009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81006#factFINAL assume true; 81002#factEXIT >#70#return; 81004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80964#factFINAL assume true; 80963#factEXIT >#78#return; 80914#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80962#$Ultimate##0 ~n := #in~n; 81012#L25 assume !(~n <= 0); 80885#L26 call #t~ret0 := fact(~n - 1);< 80889#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#80#return; 80040#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80944#$Ultimate##0 ~n := #in~n; 81019#L25 assume !(~n <= 0); 79925#L26 call #t~ret0 := fact(~n - 1);< 80974#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#82#return; 80942#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 80993#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 80983#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 80980#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 80113#L42-4 havoc main_~k~0#1; 80080#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 80071#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80072#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81001#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 80036#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80944#$Ultimate##0 ~n := #in~n; 81019#L25 assume !(~n <= 0); 79925#L26 call #t~ret0 := fact(~n - 1);< 80974#$Ultimate##0 ~n := #in~n; 80916#L25 assume ~n <= 0;#res := 1; 80900#factFINAL assume true; 80883#factEXIT >#70#return; 80888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80961#factFINAL assume true; 80954#factEXIT >#72#return; 80865#L30-1 [2024-10-13 16:57:59,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -115555602, now seen corresponding path program 5 times [2024-10-13 16:57:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:59,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827488829] [2024-10-13 16:57:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:57:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941645573] [2024-10-13 16:57:59,181 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:57:59,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:59,184 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:59,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2024-10-13 16:57:59,303 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-13 16:57:59,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:57:59,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:59,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:59,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1945812242, now seen corresponding path program 5 times [2024-10-13 16:57:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426496288] [2024-10-13 16:57:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-13 16:57:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 16:57:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 16:57:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 16:57:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:57:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 16:57:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 16:57:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:57:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 16:57:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:57:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 123 proven. 50 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-13 16:57:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426496288] [2024-10-13 16:57:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426496288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934958678] [2024-10-13 16:57:59,513 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:57:59,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:59,515 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:59,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2024-10-13 16:57:59,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-13 16:57:59,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:59,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 16:57:59,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 123 proven. 52 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-13 16:57:59,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 123 proven. 53 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-13 16:57:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934958678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:59,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 18 [2024-10-13 16:57:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715505362] [2024-10-13 16:57:59,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:59,932 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:59,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 16:57:59,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-10-13 16:57:59,933 INFO L87 Difference]: Start difference. First operand 1668 states and 2762 transitions. cyclomatic complexity: 1123 Second operand has 19 states, 14 states have (on average 3.357142857142857) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 7 states have call predecessors, (17), 11 states have call successors, (17) [2024-10-13 16:58:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:00,213 INFO L93 Difference]: Finished difference Result 1932 states and 3403 transitions. [2024-10-13 16:58:00,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1932 states and 3403 transitions. [2024-10-13 16:58:00,226 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 438 [2024-10-13 16:58:00,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1932 states to 1932 states and 3403 transitions. [2024-10-13 16:58:00,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 830 [2024-10-13 16:58:00,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2024-10-13 16:58:00,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1932 states and 3403 transitions. [2024-10-13 16:58:00,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:00,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1932 states and 3403 transitions. [2024-10-13 16:58:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states and 3403 transitions. [2024-10-13 16:58:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1668. [2024-10-13 16:58:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1035 states have (on average 1.0801932367149758) internal successors, (1118), 1017 states have internal predecessors, (1118), 448 states have call successors, (448), 183 states have call predecessors, (448), 185 states have return successors, (1195), 467 states have call predecessors, (1195), 448 states have call successors, (1195) [2024-10-13 16:58:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2761 transitions. [2024-10-13 16:58:00,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1668 states and 2761 transitions. [2024-10-13 16:58:00,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 16:58:00,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 1668 states and 2761 transitions. [2024-10-13 16:58:00,281 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-13 16:58:00,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1668 states and 2761 transitions. [2024-10-13 16:58:00,285 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 310 [2024-10-13 16:58:00,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:00,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:00,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 7, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:00,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [27, 27, 15, 15, 15, 15, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:00,286 INFO L745 eck$LassoCheckResult]: Stem: 84552#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 84496#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 84497#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 84518#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 84553#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84658#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84656#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84479#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84480#$Ultimate##0 ~n := #in~n; 84864#L25 assume ~n <= 0;#res := 1; 84863#factFINAL assume true; 84609#factEXIT >#72#return; 84610#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84861#$Ultimate##0 ~n := #in~n; 84862#L25 assume ~n <= 0;#res := 1; 84652#factFINAL assume true; 84653#factEXIT >#74#return; 84859#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84860#$Ultimate##0 ~n := #in~n; 84866#L25 assume ~n <= 0;#res := 1; 84865#factFINAL assume true; 84858#factEXIT >#76#return; 84514#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 84515#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 84829#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 84827#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84826#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84824#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84825#$Ultimate##0 ~n := #in~n; 84876#L25 assume !(~n <= 0); 84847#L26 call #t~ret0 := fact(~n - 1);< 84874#$Ultimate##0 ~n := #in~n; 84888#L25 assume ~n <= 0;#res := 1; 84887#factFINAL assume true; 84873#factEXIT >#70#return; 84872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84868#factFINAL assume true; 84823#factEXIT >#78#return; 84819#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84821#$Ultimate##0 ~n := #in~n; 84841#L25 assume ~n <= 0;#res := 1; 84836#factFINAL assume true; 84818#factEXIT >#80#return; 84810#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84813#$Ultimate##0 ~n := #in~n; 84894#L25 assume !(~n <= 0); 84833#L26 call #t~ret0 := fact(~n - 1);< 84835#$Ultimate##0 ~n := #in~n; 84851#L25 assume ~n <= 0;#res := 1; 84844#factFINAL assume true; 84832#factEXIT >#70#return; 84831#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84816#factFINAL assume true; 84809#factEXIT >#82#return; 84806#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 84805#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 84801#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 84558#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 84557#L42-4 havoc main_~k~0#1; 84517#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 84509#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84511#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85697#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84412#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85693#$Ultimate##0 ~n := #in~n; 85734#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85833#L25 assume ~n <= 0;#res := 1; 85832#factFINAL assume true; 85781#factEXIT >#70#return; 85778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85769#factFINAL assume true; 85757#factEXIT >#70#return; 85763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85835#factFINAL assume true; 85834#factEXIT >#72#return; 85672#L30-1 [2024-10-13 16:58:00,287 INFO L747 eck$LassoCheckResult]: Loop: 85672#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85737#$Ultimate##0 ~n := #in~n; 85698#L25 assume ~n <= 0;#res := 1; 85695#factFINAL assume true; 85666#factEXIT >#74#return; 84360#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85812#$Ultimate##0 ~n := #in~n; 85788#L25 assume !(~n <= 0); 85761#L26 call #t~ret0 := fact(~n - 1);< 85765#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85833#L25 assume ~n <= 0;#res := 1; 85832#factFINAL assume true; 85781#factEXIT >#70#return; 85778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85769#factFINAL assume true; 85757#factEXIT >#70#return; 85762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85819#factFINAL assume true; 85816#factEXIT >#70#return; 84529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84530#factFINAL assume true; 84345#factEXIT >#76#return; 84447#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85923#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 85922#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85920#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84433#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85824#$Ultimate##0 ~n := #in~n; 85792#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85833#L25 assume ~n <= 0;#res := 1; 85832#factFINAL assume true; 85781#factEXIT >#70#return; 85778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85769#factFINAL assume true; 85757#factEXIT >#70#return; 85763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85835#factFINAL assume true; 85834#factEXIT >#72#return; 85671#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85696#$Ultimate##0 ~n := #in~n; 85780#L25 assume ~n <= 0;#res := 1; 85695#factFINAL assume true; 85666#factEXIT >#74#return; 84369#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85824#$Ultimate##0 ~n := #in~n; 85792#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85728#L25 assume ~n <= 0;#res := 1; 85713#factFINAL assume true; 85703#factEXIT >#70#return; 85710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85823#factFINAL assume true; 85795#factEXIT >#76#return; 85797#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85919#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 85918#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85917#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85916#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84387#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85824#$Ultimate##0 ~n := #in~n; 85792#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85833#L25 assume ~n <= 0;#res := 1; 85832#factFINAL assume true; 85781#factEXIT >#70#return; 85778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85769#factFINAL assume true; 85757#factEXIT >#70#return; 85763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85835#factFINAL assume true; 85834#factEXIT >#72#return; 85670#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85696#$Ultimate##0 ~n := #in~n; 85780#L25 assume !(~n <= 0); 85706#L26 call #t~ret0 := fact(~n - 1);< 85711#$Ultimate##0 ~n := #in~n; 85728#L25 assume ~n <= 0;#res := 1; 85713#factFINAL assume true; 85703#factEXIT >#70#return; 85710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85823#factFINAL assume true; 85795#factEXIT >#74#return; 84357#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85693#$Ultimate##0 ~n := #in~n; 85734#L25 assume ~n <= 0;#res := 1; 85695#factFINAL assume true; 85666#factEXIT >#76#return; 85687#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85912#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 85910#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85909#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85907#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84413#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85824#$Ultimate##0 ~n := #in~n; 85792#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85833#L25 assume ~n <= 0;#res := 1; 85832#factFINAL assume true; 85781#factEXIT >#70#return; 85778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85769#factFINAL assume true; 85757#factEXIT >#70#return; 85763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85835#factFINAL assume true; 85834#factEXIT >#78#return; 85718#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85801#$Ultimate##0 ~n := #in~n; 85779#L25 assume !(~n <= 0); 85706#L26 call #t~ret0 := fact(~n - 1);< 85711#$Ultimate##0 ~n := #in~n; 85728#L25 assume ~n <= 0;#res := 1; 85713#factFINAL assume true; 85703#factEXIT >#70#return; 85710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85823#factFINAL assume true; 85795#factEXIT >#80#return; 84358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85824#$Ultimate##0 ~n := #in~n; 85792#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85728#L25 assume ~n <= 0;#res := 1; 85713#factFINAL assume true; 85703#factEXIT >#70#return; 85710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85823#factFINAL assume true; 85795#factEXIT >#82#return; 84460#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85930#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 85928#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85925#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 84556#L42-4 havoc main_~k~0#1; 84516#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 84507#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84508#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85904#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84414#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85824#$Ultimate##0 ~n := #in~n; 85792#L25 assume !(~n <= 0); 85704#L26 call #t~ret0 := fact(~n - 1);< 85764#$Ultimate##0 ~n := #in~n; 85786#L25 assume !(~n <= 0); 85759#L26 call #t~ret0 := fact(~n - 1);< 85784#$Ultimate##0 ~n := #in~n; 85833#L25 assume ~n <= 0;#res := 1; 85832#factFINAL assume true; 85781#factEXIT >#70#return; 85778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85769#factFINAL assume true; 85757#factEXIT >#70#return; 85763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85835#factFINAL assume true; 85834#factEXIT >#72#return; 85672#L30-1 [2024-10-13 16:58:00,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1976289170, now seen corresponding path program 6 times [2024-10-13 16:58:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:00,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640362495] [2024-10-13 16:58:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 16:58:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-13 16:58:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640362495] [2024-10-13 16:58:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640362495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349931464] [2024-10-13 16:58:00,384 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:58:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:00,386 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2024-10-13 16:58:00,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-13 16:58:00,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:00,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 16:58:00,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-13 16:58:00,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-13 16:58:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349931464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:00,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:00,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 12 [2024-10-13 16:58:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488395813] [2024-10-13 16:58:00,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:00,642 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash 582093257, now seen corresponding path program 6 times [2024-10-13 16:58:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997943885] [2024-10-13 16:58:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-13 16:58:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 16:58:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 16:58:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 16:58:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 16:58:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 16:58:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 16:58:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 16:58:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 16:58:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 16:58:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 16:58:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 16:58:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 132 proven. 315 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2024-10-13 16:58:00,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997943885] [2024-10-13 16:58:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997943885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492037463] [2024-10-13 16:58:00,887 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:58:00,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:00,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:00,889 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:00,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2024-10-13 16:58:01,024 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-10-13 16:58:01,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:01,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 16:58:01,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 998 proven. 33 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2024-10-13 16:58:01,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 210 proven. 191 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-10-13 16:58:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492037463] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:01,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 27 [2024-10-13 16:58:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375803084] [2024-10-13 16:58:01,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:01,434 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 16:58:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 16:58:01,434 INFO L87 Difference]: Start difference. First operand 1668 states and 2761 transitions. cyclomatic complexity: 1124 Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2024-10-13 16:58:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:01,595 INFO L93 Difference]: Finished difference Result 1929 states and 3365 transitions. [2024-10-13 16:58:01,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1929 states and 3365 transitions. [2024-10-13 16:58:01,604 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 366 [2024-10-13 16:58:01,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1929 states to 1929 states and 3365 transitions. [2024-10-13 16:58:01,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 733 [2024-10-13 16:58:01,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 733 [2024-10-13 16:58:01,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1929 states and 3365 transitions. [2024-10-13 16:58:01,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:01,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1929 states and 3365 transitions. [2024-10-13 16:58:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states and 3365 transitions. [2024-10-13 16:58:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1674. [2024-10-13 16:58:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1040 states have (on average 1.0807692307692307) internal successors, (1124), 1023 states have internal predecessors, (1124), 449 states have call successors, (449), 183 states have call predecessors, (449), 185 states have return successors, (1197), 467 states have call predecessors, (1197), 449 states have call successors, (1197) [2024-10-13 16:58:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2770 transitions. [2024-10-13 16:58:01,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1674 states and 2770 transitions. [2024-10-13 16:58:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 16:58:01,650 INFO L425 stractBuchiCegarLoop]: Abstraction has 1674 states and 2770 transitions. [2024-10-13 16:58:01,650 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-10-13 16:58:01,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1674 states and 2770 transitions. [2024-10-13 16:58:01,654 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 310 [2024-10-13 16:58:01,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:01,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:01,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:01,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:01,655 INFO L745 eck$LassoCheckResult]: Stem: 89890#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 89835#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 89836#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 89857#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 89891#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 89998#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 89996#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 89992#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 90000#$Ultimate##0 ~n := #in~n; 89999#L25 assume ~n <= 0;#res := 1; 89991#factFINAL assume true; 89993#factEXIT >#72#return; 89934#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 89968#$Ultimate##0 ~n := #in~n; 89933#L25 assume ~n <= 0;#res := 1; 89935#factFINAL assume true; 89967#factEXIT >#74#return; 89824#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 89825#$Ultimate##0 ~n := #in~n; 90010#L25 assume ~n <= 0;#res := 1; 90009#factFINAL assume true; 90007#factEXIT >#76#return; 90008#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 89865#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 89866#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 91138#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91136#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 91133#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91134#$Ultimate##0 ~n := #in~n; 91143#L25 assume !(~n <= 0); 91140#L26 call #t~ret0 := fact(~n - 1);< 91141#$Ultimate##0 ~n := #in~n; 91144#L25 assume ~n <= 0;#res := 1; 91142#factFINAL assume true; 91139#factEXIT >#70#return; 91137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91135#factFINAL assume true; 91132#factEXIT >#78#return; 91128#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91130#$Ultimate##0 ~n := #in~n; 91212#L25 assume ~n <= 0;#res := 1; 91131#factFINAL assume true; 91127#factEXIT >#80#return; 91124#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91126#$Ultimate##0 ~n := #in~n; 91404#L25 assume !(~n <= 0); 91234#L26 call #t~ret0 := fact(~n - 1);< 91255#$Ultimate##0 ~n := #in~n; 91420#L25 assume ~n <= 0;#res := 1; 91419#factFINAL assume true; 91418#factEXIT >#70#return; 91395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91396#factFINAL assume true; 91416#factEXIT >#82#return; 91417#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 91454#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 91453#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 91452#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91451#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 89832#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91257#$Ultimate##0 ~n := #in~n; 91256#L25 assume !(~n <= 0); 91235#L26 call #t~ret0 := fact(~n - 1);< 91255#$Ultimate##0 ~n := #in~n; 91145#L25 assume !(~n <= 0); 91232#L26 call #t~ret0 := fact(~n - 1);< 91249#$Ultimate##0 ~n := #in~n; 91243#L25 assume ~n <= 0;#res := 1; 91244#factFINAL assume true; 91237#factEXIT >#70#return; 91231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91236#factFINAL assume true; 91315#factEXIT >#70#return; 91308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91309#factFINAL assume true; 91146#factEXIT >#78#return; 91129#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91130#$Ultimate##0 ~n := #in~n; 91212#L25 assume ~n <= 0;#res := 1; 91131#factFINAL assume true; 91127#factEXIT >#80#return; 91125#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91126#$Ultimate##0 ~n := #in~n; 91404#L25 assume !(~n <= 0); 91234#L26 call #t~ret0 := fact(~n - 1);< 91255#$Ultimate##0 ~n := #in~n; 91420#L25 assume ~n <= 0;#res := 1; 91419#factFINAL assume true; 91418#factEXIT >#70#return; 91395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91396#factFINAL assume true; 91416#factEXIT >#82#return; 91121#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 91122#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 91288#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 91289#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91063#L43 [2024-10-13 16:58:01,656 INFO L747 eck$LassoCheckResult]: Loop: 91063#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 89812#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 89813#$Ultimate##0 ~n := #in~n; 91055#L25 assume !(~n <= 0); 91049#L26 call #t~ret0 := fact(~n - 1);< 91051#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 89873#L25 assume ~n <= 0;#res := 1; 89875#factFINAL assume true; 91098#factEXIT >#70#return; 91096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91094#factFINAL assume true; 91091#factEXIT >#70#return; 91090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91089#factFINAL assume true; 91088#factEXIT >#70#return; 91087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91086#factFINAL assume true; 91085#factEXIT >#70#return; 91083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91082#factFINAL assume true; 91081#factEXIT >#70#return; 91077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91078#factFINAL assume true; 91076#factEXIT >#70#return; 91074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91073#factFINAL assume true; 91072#factEXIT >#78#return; 89886#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 89887#$Ultimate##0 ~n := #in~n; 90917#L25 assume ~n <= 0;#res := 1; 90914#factFINAL assume true; 90913#factEXIT >#80#return; 89817#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 89892#$Ultimate##0 ~n := #in~n; 90942#L25 assume !(~n <= 0); 89840#L26 call #t~ret0 := fact(~n - 1);< 89841#$Ultimate##0 ~n := #in~n; 91060#L25 assume !(~n <= 0); 91057#L26 call #t~ret0 := fact(~n - 1);< 91059#$Ultimate##0 ~n := #in~n; 91058#L25 assume !(~n <= 0); 91053#L26 call #t~ret0 := fact(~n - 1);< 91056#$Ultimate##0 ~n := #in~n; 91054#L25 assume !(~n <= 0); 91050#L26 call #t~ret0 := fact(~n - 1);< 91052#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 91048#L25 assume !(~n <= 0); 89874#L26 call #t~ret0 := fact(~n - 1);< 91047#$Ultimate##0 ~n := #in~n; 89873#L25 assume ~n <= 0;#res := 1; 89875#factFINAL assume true; 91098#factEXIT >#70#return; 91096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91094#factFINAL assume true; 91091#factEXIT >#70#return; 91090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91089#factFINAL assume true; 91088#factEXIT >#70#return; 91087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91086#factFINAL assume true; 91085#factEXIT >#70#return; 91083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91082#factFINAL assume true; 91081#factEXIT >#70#return; 91077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91078#factFINAL assume true; 91076#factEXIT >#70#return; 91074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91073#factFINAL assume true; 91072#factEXIT >#82#return; 89818#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 89837#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 89858#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 91101#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91063#L43 [2024-10-13 16:58:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -511129123, now seen corresponding path program 11 times [2024-10-13 16:58:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785535669] [2024-10-13 16:58:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:58:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 16:58:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:58:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-10-13 16:58:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785535669] [2024-10-13 16:58:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785535669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148016863] [2024-10-13 16:58:01,774 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:58:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:01,776 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:01,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2024-10-13 16:58:01,910 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-10-13 16:58:01,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:01,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 16:58:01,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 119 proven. 43 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-13 16:58:01,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 119 proven. 45 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-10-13 16:58:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148016863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:02,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 23 [2024-10-13 16:58:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596433971] [2024-10-13 16:58:02,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:02,206 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1591615748, now seen corresponding path program 14 times [2024-10-13 16:58:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687920124] [2024-10-13 16:58:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867354319] [2024-10-13 16:58:02,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:02,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:02,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:02,217 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:02,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2024-10-13 16:58:02,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:02,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:02,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:02,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:02,918 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:02,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:02,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:02,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:02,918 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:02,919 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:02,919 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:02,919 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:02,919 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration28_Loop [2024-10-13 16:58:02,919 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:02,919 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:02,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:02,968 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:02,968 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:02,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:02,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:02,985 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-10-13 16:58:02,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:02,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:03,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-10-13 16:58:03,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:03,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:03,017 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:03,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-10-13 16:58:03,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:03,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:03,030 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:03,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-10-13 16:58:03,042 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:03,042 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:03,042 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:03,042 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:03,042 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:03,042 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:03,042 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:03,042 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:03,042 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration28_Loop [2024-10-13 16:58:03,042 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:03,043 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:03,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:03,093 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:03,093 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:03,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:03,095 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:03,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-10-13 16:58:03,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-13 16:58:03,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:03,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:03,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:03,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:03,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:03,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:03,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:03,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:03,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:03,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:03,112 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:03,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-10-13 16:58:03,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:03,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:03,113 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:03,113 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 13 Supporting invariants [] [2024-10-13 16:58:03,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-10-13 16:58:03,124 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:03,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:03,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 16:58:03,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:03,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 16:58:03,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-13 16:58:03,873 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2024-10-13 16:58:03,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1674 states and 2770 transitions. cyclomatic complexity: 1127 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-13 16:58:04,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1674 states and 2770 transitions. cyclomatic complexity: 1127. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) Result 3532 states and 5315 transitions. Complement of second has 101 states. [2024-10-13 16:58:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-13 16:58:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2024-10-13 16:58:04,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 75 transitions. Stem has 96 letters. Loop has 92 letters. [2024-10-13 16:58:04,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:04,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 75 transitions. Stem has 188 letters. Loop has 92 letters. [2024-10-13 16:58:04,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:04,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 75 transitions. Stem has 96 letters. Loop has 184 letters. [2024-10-13 16:58:04,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:04,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3532 states and 5315 transitions. [2024-10-13 16:58:04,240 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 310 [2024-10-13 16:58:04,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3532 states to 2270 states and 3625 transitions. [2024-10-13 16:58:04,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 584 [2024-10-13 16:58:04,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 585 [2024-10-13 16:58:04,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2270 states and 3625 transitions. [2024-10-13 16:58:04,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:04,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2270 states and 3625 transitions. [2024-10-13 16:58:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states and 3625 transitions. [2024-10-13 16:58:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1888. [2024-10-13 16:58:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1182 states have (on average 1.0820642978003383) internal successors, (1279), 1163 states have internal predecessors, (1279), 479 states have call successors, (479), 207 states have call predecessors, (479), 227 states have return successors, (1365), 517 states have call predecessors, (1365), 479 states have call successors, (1365) [2024-10-13 16:58:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 3123 transitions. [2024-10-13 16:58:04,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1888 states and 3123 transitions. [2024-10-13 16:58:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:04,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 16:58:04,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-10-13 16:58:04,293 INFO L87 Difference]: Start difference. First operand 1888 states and 3123 transitions. Second operand has 23 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 13 states have call successors, (24), 1 states have call predecessors, (24), 4 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25) [2024-10-13 16:58:04,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-10-13 16:58:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:04,762 INFO L93 Difference]: Finished difference Result 1901 states and 3058 transitions. [2024-10-13 16:58:04,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1901 states and 3058 transitions. [2024-10-13 16:58:04,777 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 285 [2024-10-13 16:58:04,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1901 states to 1880 states and 3021 transitions. [2024-10-13 16:58:04,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 563 [2024-10-13 16:58:04,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2024-10-13 16:58:04,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1880 states and 3021 transitions. [2024-10-13 16:58:04,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:04,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1880 states and 3021 transitions. [2024-10-13 16:58:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states and 3021 transitions. [2024-10-13 16:58:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1789. [2024-10-13 16:58:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1137 states have (on average 1.0738786279683377) internal successors, (1221), 1118 states have internal predecessors, (1221), 425 states have call successors, (425), 204 states have call predecessors, (425), 227 states have return successors, (1201), 466 states have call predecessors, (1201), 425 states have call successors, (1201) [2024-10-13 16:58:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2847 transitions. [2024-10-13 16:58:04,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1789 states and 2847 transitions. [2024-10-13 16:58:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 16:58:04,843 INFO L425 stractBuchiCegarLoop]: Abstraction has 1789 states and 2847 transitions. [2024-10-13 16:58:04,844 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-10-13 16:58:04,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1789 states and 2847 transitions. [2024-10-13 16:58:04,851 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 252 [2024-10-13 16:58:04,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:04,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:04,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:04,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 14, 14, 14, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:04,852 INFO L745 eck$LassoCheckResult]: Stem: 100363#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 100306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 100307#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 100328#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 100364#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100557#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100555#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 100498#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100503#$Ultimate##0 ~n := #in~n; 100501#L25 assume ~n <= 0;#res := 1; 100497#factFINAL assume true; 100499#factEXIT >#72#return; 100351#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100352#$Ultimate##0 ~n := #in~n; 100656#L25 assume ~n <= 0;#res := 1; 100558#factFINAL assume true; 100376#factEXIT >#74#return; 100289#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100290#$Ultimate##0 ~n := #in~n; 100496#L25 assume ~n <= 0;#res := 1; 100493#factFINAL assume true; 100491#factEXIT >#76#return; 100492#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 100335#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 100336#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 101589#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 101587#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 101584#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 101585#$Ultimate##0 ~n := #in~n; 101594#L25 assume !(~n <= 0); 101591#L26 call #t~ret0 := fact(~n - 1);< 101592#$Ultimate##0 ~n := #in~n; 101595#L25 assume ~n <= 0;#res := 1; 101593#factFINAL assume true; 101590#factEXIT >#70#return; 101588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101586#factFINAL assume true; 101583#factEXIT >#78#return; 101581#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 101582#$Ultimate##0 ~n := #in~n; 101829#L25 assume ~n <= 0;#res := 1; 101818#factFINAL assume true; 101815#factEXIT >#80#return; 101797#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 101806#$Ultimate##0 ~n := #in~n; 101801#L25 assume !(~n <= 0); 101787#L26 call #t~ret0 := fact(~n - 1);< 101794#$Ultimate##0 ~n := #in~n; 101912#L25 assume ~n <= 0;#res := 1; 101911#factFINAL assume true; 101910#factEXIT >#70#return; 101909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101908#factFINAL assume true; 101906#factEXIT >#82#return; 101907#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 101957#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 101956#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 101954#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 101953#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 101792#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 101802#$Ultimate##0 ~n := #in~n; 101799#L25 assume !(~n <= 0); 101789#L26 call #t~ret0 := fact(~n - 1);< 101794#$Ultimate##0 ~n := #in~n; 101596#L25 assume !(~n <= 0); 101783#L26 call #t~ret0 := fact(~n - 1);< 101786#$Ultimate##0 ~n := #in~n; 101782#L25 assume ~n <= 0;#res := 1; 101784#factFINAL assume true; 101833#factEXIT >#70#return; 101832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101831#factFINAL assume true; 101826#factEXIT >#70#return; 101827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101830#factFINAL assume true; 101819#factEXIT >#78#return; 101816#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 101582#$Ultimate##0 ~n := #in~n; 101829#L25 assume ~n <= 0;#res := 1; 101818#factFINAL assume true; 101815#factEXIT >#80#return; 101798#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 101806#$Ultimate##0 ~n := #in~n; 101801#L25 assume !(~n <= 0); 101787#L26 call #t~ret0 := fact(~n - 1);< 101794#$Ultimate##0 ~n := #in~n; 101596#L25 assume !(~n <= 0); 101783#L26 call #t~ret0 := fact(~n - 1);< 101786#$Ultimate##0 ~n := #in~n; 101782#L25 assume ~n <= 0;#res := 1; 101784#factFINAL assume true; 101833#factEXIT >#70#return; 101832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101831#factFINAL assume true; 101826#factEXIT >#70#return; 101817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101814#factFINAL assume true; 101813#factEXIT >#82#return; 101812#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 101811#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 101810#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 101808#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 101341#L43 [2024-10-13 16:58:04,852 INFO L747 eck$LassoCheckResult]: Loop: 101341#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 101300#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 101303#$Ultimate##0 ~n := #in~n; 101338#L25 assume !(~n <= 0); 101317#L26 call #t~ret0 := fact(~n - 1);< 101324#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101363#L25 assume ~n <= 0;#res := 1; 101362#factFINAL assume true; 101358#factEXIT >#70#return; 101357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101355#factFINAL assume true; 101352#factEXIT >#70#return; 101351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101349#factFINAL assume true; 101346#factEXIT >#70#return; 101342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101340#factFINAL assume true; 101339#factEXIT >#70#return; 101337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101335#factFINAL assume true; 101334#factEXIT >#70#return; 101333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101330#factFINAL assume true; 101328#factEXIT >#70#return; 101323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101325#factFINAL assume true; 101316#factEXIT >#70#return; 101315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101310#factFINAL assume true; 101299#factEXIT >#78#return; 100358#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100359#$Ultimate##0 ~n := #in~n; 101314#L25 assume ~n <= 0;#res := 1; 101313#factFINAL assume true; 101312#factEXIT >#80#return; 101301#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 101311#$Ultimate##0 ~n := #in~n; 101332#L25 assume !(~n <= 0); 101321#L26 call #t~ret0 := fact(~n - 1);< 101331#$Ultimate##0 ~n := #in~n; 101373#L25 assume !(~n <= 0); 101319#L26 call #t~ret0 := fact(~n - 1);< 101326#$Ultimate##0 ~n := #in~n; 101360#L25 assume !(~n <= 0); 101320#L26 call #t~ret0 := fact(~n - 1);< 101347#$Ultimate##0 ~n := #in~n; 101361#L25 assume !(~n <= 0); 101322#L26 call #t~ret0 := fact(~n - 1);< 101353#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101364#L25 assume !(~n <= 0); 101318#L26 call #t~ret0 := fact(~n - 1);< 101359#$Ultimate##0 ~n := #in~n; 101363#L25 assume ~n <= 0;#res := 1; 101362#factFINAL assume true; 101358#factEXIT >#70#return; 101357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101355#factFINAL assume true; 101352#factEXIT >#70#return; 101351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101349#factFINAL assume true; 101346#factEXIT >#70#return; 101342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101340#factFINAL assume true; 101339#factEXIT >#70#return; 101337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101335#factFINAL assume true; 101334#factEXIT >#70#return; 101333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101330#factFINAL assume true; 101328#factEXIT >#70#return; 101323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101325#factFINAL assume true; 101316#factEXIT >#70#return; 101315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101310#factFINAL assume true; 101299#factEXIT >#82#return; 101302#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 101350#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 101348#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 101345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 101341#L43 [2024-10-13 16:58:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2060615971, now seen corresponding path program 12 times [2024-10-13 16:58:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:04,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941560128] [2024-10-13 16:58:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:04,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130679752] [2024-10-13 16:58:04,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:58:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:04,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:04,868 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:04,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2024-10-13 16:58:05,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-10-13 16:58:05,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:05,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:05,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash -173625348, now seen corresponding path program 15 times [2024-10-13 16:58:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898139648] [2024-10-13 16:58:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516528344] [2024-10-13 16:58:05,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:05,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:05,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:05,088 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:05,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2024-10-13 16:58:07,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2024-10-13 16:58:07,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:07,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:07,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:07,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash -325172520, now seen corresponding path program 13 times [2024-10-13 16:58:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:07,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058268691] [2024-10-13 16:58:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:58:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 16:58:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:58:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 16:58:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 16:58:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-13 16:58:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 308 proven. 214 refuted. 0 times theorem prover too weak. 1879 trivial. 0 not checked. [2024-10-13 16:58:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058268691] [2024-10-13 16:58:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058268691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101206295] [2024-10-13 16:58:07,883 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:58:07,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:07,885 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:07,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2024-10-13 16:58:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:08,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 16:58:08,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1315 proven. 53 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-10-13 16:58:08,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 305 proven. 226 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2024-10-13 16:58:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101206295] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:08,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 21 [2024-10-13 16:58:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418567315] [2024-10-13 16:58:08,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:09,036 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:09,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:09,037 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:09,037 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:09,037 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:09,037 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,037 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:09,037 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:09,037 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration29_Loop [2024-10-13 16:58:09,037 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:09,037 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:09,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:09,082 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,084 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-10-13 16:58:09,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:09,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:09,096 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:09,096 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,108 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-10-13 16:58:09,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:09,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:09,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,132 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-10-13 16:58:09,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:09,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:09,145 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:09,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-10-13 16:58:09,156 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:09,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:09,156 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:09,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:09,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:09,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:09,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:09,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration29_Loop [2024-10-13 16:58:09,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:09,156 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:09,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:09,204 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:09,204 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:09,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,206 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-10-13 16:58:09,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:09,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:09,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:09,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:09,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:09,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:09,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:09,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:09,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:09,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-10-13 16:58:09,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,231 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-10-13 16:58:09,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:09,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:09,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:09,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:09,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:09,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:09,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:09,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:09,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:09,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:09,245 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:09,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:09,247 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:09,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-10-13 16:58:09,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:09,248 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:09,248 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:09,248 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 15 Supporting invariants [] [2024-10-13 16:58:09,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-10-13 16:58:09,259 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:09,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 16:58:09,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:09,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-13 16:58:09,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-10-13 16:58:10,062 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 14 loop predicates [2024-10-13 16:58:10,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1789 states and 2847 transitions. cyclomatic complexity: 1091 Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-13 16:58:10,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1789 states and 2847 transitions. cyclomatic complexity: 1091. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 4282 states and 6279 transitions. Complement of second has 113 states. [2024-10-13 16:58:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 21 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-13 16:58:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 81 transitions. [2024-10-13 16:58:10,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 81 transitions. Stem has 102 letters. Loop has 104 letters. [2024-10-13 16:58:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 81 transitions. Stem has 206 letters. Loop has 104 letters. [2024-10-13 16:58:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:10,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 81 transitions. Stem has 102 letters. Loop has 208 letters. [2024-10-13 16:58:10,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:10,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4282 states and 6279 transitions. [2024-10-13 16:58:10,436 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 252 [2024-10-13 16:58:10,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4282 states to 2609 states and 3994 transitions. [2024-10-13 16:58:10,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 501 [2024-10-13 16:58:10,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 502 [2024-10-13 16:58:10,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2609 states and 3994 transitions. [2024-10-13 16:58:10,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:10,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2609 states and 3994 transitions. [2024-10-13 16:58:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states and 3994 transitions. [2024-10-13 16:58:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2015. [2024-10-13 16:58:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1287 states have (on average 1.0769230769230769) internal successors, (1386), 1266 states have internal predecessors, (1386), 455 states have call successors, (455), 228 states have call predecessors, (455), 273 states have return successors, (1399), 520 states have call predecessors, (1399), 455 states have call successors, (1399) [2024-10-13 16:58:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3240 transitions. [2024-10-13 16:58:10,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2015 states and 3240 transitions. [2024-10-13 16:58:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 16:58:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-10-13 16:58:10,491 INFO L87 Difference]: Start difference. First operand 2015 states and 3240 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 18 states have internal predecessors, (62), 13 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2024-10-13 16:58:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:10,709 INFO L93 Difference]: Finished difference Result 2476 states and 4238 transitions. [2024-10-13 16:58:10,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2476 states and 4238 transitions. [2024-10-13 16:58:10,721 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 555 [2024-10-13 16:58:10,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2476 states to 2455 states and 4206 transitions. [2024-10-13 16:58:10,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 836 [2024-10-13 16:58:10,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 836 [2024-10-13 16:58:10,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2455 states and 4206 transitions. [2024-10-13 16:58:10,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:10,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2455 states and 4206 transitions. [2024-10-13 16:58:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states and 4206 transitions. [2024-10-13 16:58:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2118. [2024-10-13 16:58:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 1349 states have (on average 1.0800593031875463) internal successors, (1457), 1331 states have internal predecessors, (1457), 496 states have call successors, (496), 228 states have call predecessors, (496), 273 states have return successors, (1512), 558 states have call predecessors, (1512), 496 states have call successors, (1512) [2024-10-13 16:58:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3465 transitions. [2024-10-13 16:58:10,810 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2118 states and 3465 transitions. [2024-10-13 16:58:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 16:58:10,814 INFO L425 stractBuchiCegarLoop]: Abstraction has 2118 states and 3465 transitions. [2024-10-13 16:58:10,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-10-13 16:58:10,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2118 states and 3465 transitions. [2024-10-13 16:58:10,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:10,824 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 298 [2024-10-13 16:58:10,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:10,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:10,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 21, 13, 8, 8, 8, 8, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-13 16:58:10,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:10,826 INFO L745 eck$LassoCheckResult]: Stem: 113470#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 113415#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 113416#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 113438#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 113471#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 113572#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113569#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113407#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113408#$Ultimate##0 ~n := #in~n; 113578#L25 assume ~n <= 0;#res := 1; 113579#factFINAL assume true; 113526#factEXIT >#72#return; 113527#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113584#$Ultimate##0 ~n := #in~n; 113585#L25 assume ~n <= 0;#res := 1; 113576#factFINAL assume true; 113577#factEXIT >#74#return; 113403#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113404#$Ultimate##0 ~n := #in~n; 114269#L25 assume ~n <= 0;#res := 1; 114268#factFINAL assume true; 113625#factEXIT >#76#return; 113626#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113446#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 113447#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 114929#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114924#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114914#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114921#$Ultimate##0 ~n := #in~n; 114941#L25 assume !(~n <= 0); 114927#L26 call #t~ret0 := fact(~n - 1);< 114928#$Ultimate##0 ~n := #in~n; 114939#L25 assume ~n <= 0;#res := 1; 114937#factFINAL assume true; 114926#factEXIT >#70#return; 114923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114920#factFINAL assume true; 114913#factEXIT >#78#return; 114909#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114910#$Ultimate##0 ~n := #in~n; 114912#L25 assume ~n <= 0;#res := 1; 114911#factFINAL assume true; 114906#factEXIT >#80#return; 113412#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114905#$Ultimate##0 ~n := #in~n; 114953#L25 assume !(~n <= 0); 114932#L26 call #t~ret0 := fact(~n - 1);< 114936#$Ultimate##0 ~n := #in~n; 115154#L25 assume ~n <= 0;#res := 1; 115151#factFINAL assume true; 115150#factEXIT >#70#return; 115145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115144#factFINAL assume true; 114903#factEXIT >#82#return; 114904#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114899#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 114900#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 113481#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 113482#L42-4 havoc main_~k~0#1; 113436#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 113437#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 113430#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113565#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113556#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113557#$Ultimate##0 ~n := #in~n; 113564#L25 assume ~n <= 0;#res := 1; 113562#factFINAL assume true; 113555#factEXIT >#72#return; 113538#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113547#$Ultimate##0 ~n := #in~n; 113561#L25 assume ~n <= 0;#res := 1; 113554#factFINAL assume true; 113535#factEXIT >#74#return; 113491#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113532#$Ultimate##0 ~n := #in~n; 113610#L25 assume ~n <= 0;#res := 1; 113554#factFINAL assume true; 113535#factEXIT >#76#return; 113543#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113563#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 113560#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 113553#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113548#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113490#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113530#$Ultimate##0 ~n := #in~n; 113609#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113603#$Ultimate##0 ~n := #in~n; 113567#L25 assume ~n <= 0;#res := 1; 113559#factFINAL assume true; 113549#factEXIT >#70#return; 113534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113529#factFINAL assume true; 113486#factEXIT >#78#return; 113523#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113547#$Ultimate##0 ~n := #in~n; 113561#L25 assume ~n <= 0;#res := 1; 113554#factFINAL assume true; 113535#factEXIT >#80#return; 113514#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113530#$Ultimate##0 ~n := #in~n; 113609#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113603#$Ultimate##0 ~n := #in~n; 113567#L25 assume ~n <= 0;#res := 1; 113559#factFINAL assume true; 113549#factEXIT >#70#return; 113534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113529#factFINAL assume true; 113486#factEXIT >#82#return; 113525#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113685#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 113683#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 113681#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 113475#L42-4 havoc main_~k~0#1; 113476#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 113428#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 113429#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114091#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113747#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113402#$Ultimate##0 ~n := #in~n; 114042#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113906#L25 assume ~n <= 0;#res := 1; 113875#factFINAL assume true; 113871#factEXIT >#70#return; 113868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113832#factFINAL assume true; 113837#factEXIT >#70#return; 113870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114058#factFINAL assume true; 114055#factEXIT >#70#return; 114030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114027#factFINAL assume true; 114022#factEXIT >#70#return; 114023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114088#factFINAL assume true; 114089#factEXIT >#72#return; 113993#L30-1 [2024-10-13 16:58:10,827 INFO L747 eck$LassoCheckResult]: Loop: 113993#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113457#$Ultimate##0 ~n := #in~n; 114041#L25 assume ~n <= 0;#res := 1; 114014#factFINAL assume true; 113991#factEXIT >#74#return; 113945#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113793#$Ultimate##0 ~n := #in~n; 114046#L25 assume !(~n <= 0); 113935#L26 call #t~ret0 := fact(~n - 1);< 113938#$Ultimate##0 ~n := #in~n; 113933#L25 assume !(~n <= 0); 113919#L26 call #t~ret0 := fact(~n - 1);< 113922#$Ultimate##0 ~n := #in~n; 113920#L25 assume !(~n <= 0); 113835#L26 call #t~ret0 := fact(~n - 1);< 113918#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113906#L25 assume ~n <= 0;#res := 1; 113875#factFINAL assume true; 113871#factEXIT >#70#return; 113868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113832#factFINAL assume true; 113837#factEXIT >#70#return; 113870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114058#factFINAL assume true; 114055#factEXIT >#70#return; 114030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114027#factFINAL assume true; 114022#factEXIT >#70#return; 114023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114088#factFINAL assume true; 114089#factEXIT >#76#return; 113771#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114129#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 114128#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 114127#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114126#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113751#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113795#$Ultimate##0 ~n := #in~n; 113973#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113906#L25 assume ~n <= 0;#res := 1; 113875#factFINAL assume true; 113871#factEXIT >#70#return; 113868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113832#factFINAL assume true; 113837#factEXIT >#70#return; 113800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113794#factFINAL assume true; 113697#factEXIT >#72#return; 113788#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113932#$Ultimate##0 ~n := #in~n; 114043#L25 assume ~n <= 0;#res := 1; 114014#factFINAL assume true; 113991#factEXIT >#74#return; 113729#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113795#$Ultimate##0 ~n := #in~n; 113973#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113866#L25 assume ~n <= 0;#res := 1; 113867#factFINAL assume true; 113801#factEXIT >#70#return; 113809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113972#factFINAL assume true; 113962#factEXIT >#76#return; 113964#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114198#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 114195#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 114194#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114193#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113700#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113795#$Ultimate##0 ~n := #in~n; 113973#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113906#L25 assume ~n <= 0;#res := 1; 113875#factFINAL assume true; 113871#factEXIT >#70#return; 113868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113832#factFINAL assume true; 113837#factEXIT >#70#return; 113800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113794#factFINAL assume true; 113697#factEXIT >#72#return; 113768#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113932#$Ultimate##0 ~n := #in~n; 114043#L25 assume !(~n <= 0); 113802#L26 call #t~ret0 := fact(~n - 1);< 113891#$Ultimate##0 ~n := #in~n; 113866#L25 assume ~n <= 0;#res := 1; 113867#factFINAL assume true; 113801#factEXIT >#70#return; 113809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113972#factFINAL assume true; 113962#factEXIT >#74#return; 113740#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113402#$Ultimate##0 ~n := #in~n; 114042#L25 assume ~n <= 0;#res := 1; 114014#factFINAL assume true; 113991#factEXIT >#76#return; 113998#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114160#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 114135#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 114134#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114133#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113703#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113795#$Ultimate##0 ~n := #in~n; 113973#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113906#L25 assume ~n <= 0;#res := 1; 113875#factFINAL assume true; 113871#factEXIT >#70#return; 113868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113832#factFINAL assume true; 113837#factEXIT >#70#return; 113800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113794#factFINAL assume true; 113697#factEXIT >#78#return; 113770#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113930#$Ultimate##0 ~n := #in~n; 113929#L25 assume !(~n <= 0); 113802#L26 call #t~ret0 := fact(~n - 1);< 113891#$Ultimate##0 ~n := #in~n; 113866#L25 assume ~n <= 0;#res := 1; 113867#factFINAL assume true; 113801#factEXIT >#70#return; 113809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113972#factFINAL assume true; 113962#factEXIT >#80#return; 113739#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113795#$Ultimate##0 ~n := #in~n; 113973#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113866#L25 assume ~n <= 0;#res := 1; 113867#factFINAL assume true; 113801#factEXIT >#70#return; 113809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113972#factFINAL assume true; 113962#factEXIT >#82#return; 113775#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114131#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 114110#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 114108#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 113474#L42-4 havoc main_~k~0#1; 113435#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 113426#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 113427#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114130#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113748#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113795#$Ultimate##0 ~n := #in~n; 113973#L25 assume !(~n <= 0); 113803#L26 call #t~ret0 := fact(~n - 1);< 113917#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113905#L25 assume !(~n <= 0); 113833#L26 call #t~ret0 := fact(~n - 1);< 113873#$Ultimate##0 ~n := #in~n; 113906#L25 assume ~n <= 0;#res := 1; 113875#factFINAL assume true; 113871#factEXIT >#70#return; 113868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113832#factFINAL assume true; 113837#factEXIT >#70#return; 113870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114058#factFINAL assume true; 114055#factEXIT >#70#return; 114030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114027#factFINAL assume true; 114022#factEXIT >#70#return; 114023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114088#factFINAL assume true; 114089#factEXIT >#72#return; 113993#L30-1 [2024-10-13 16:58:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1780859912, now seen corresponding path program 7 times [2024-10-13 16:58:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964600811] [2024-10-13 16:58:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 16:58:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 16:58:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 16:58:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 16:58:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 16:58:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 16:58:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 16:58:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-10-13 16:58:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964600811] [2024-10-13 16:58:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964600811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064612012] [2024-10-13 16:58:10,922 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:58:10,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:10,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:10,940 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:10,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2024-10-13 16:58:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:58:11,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 523 proven. 1 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 16:58:11,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-10-13 16:58:11,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064612012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:11,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:11,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-13 16:58:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067386033] [2024-10-13 16:58:11,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:11,272 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:11,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1455498679, now seen corresponding path program 7 times [2024-10-13 16:58:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903705410] [2024-10-13 16:58:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-13 16:58:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 16:58:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 16:58:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 16:58:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 16:58:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 16:58:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 16:58:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 16:58:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 16:58:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 16:58:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 16:58:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 153 proven. 357 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2024-10-13 16:58:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903705410] [2024-10-13 16:58:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903705410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132726685] [2024-10-13 16:58:11,491 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:58:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:11,496 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:11,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2024-10-13 16:58:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:11,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 16:58:11,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 1170 proven. 29 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2024-10-13 16:58:11,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 152 proven. 368 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2024-10-13 16:58:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132726685] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:11,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 12] total 22 [2024-10-13 16:58:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482980221] [2024-10-13 16:58:11,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:11,964 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:11,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 16:58:11,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 16:58:11,965 INFO L87 Difference]: Start difference. First operand 2118 states and 3465 transitions. cyclomatic complexity: 1384 Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 16:58:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:12,061 INFO L93 Difference]: Finished difference Result 1788 states and 2851 transitions. [2024-10-13 16:58:12,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1788 states and 2851 transitions. [2024-10-13 16:58:12,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 263 [2024-10-13 16:58:12,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1788 states to 1781 states and 2844 transitions. [2024-10-13 16:58:12,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2024-10-13 16:58:12,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 414 [2024-10-13 16:58:12,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1781 states and 2844 transitions. [2024-10-13 16:58:12,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:12,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1781 states and 2844 transitions. [2024-10-13 16:58:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states and 2844 transitions. [2024-10-13 16:58:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2024-10-13 16:58:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1146 states have (on average 1.0785340314136125) internal successors, (1236), 1131 states have internal predecessors, (1236), 381 states have call successors, (381), 201 states have call predecessors, (381), 254 states have return successors, (1227), 448 states have call predecessors, (1227), 381 states have call successors, (1227) [2024-10-13 16:58:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2844 transitions. [2024-10-13 16:58:12,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1781 states and 2844 transitions. [2024-10-13 16:58:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 16:58:12,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 1781 states and 2844 transitions. [2024-10-13 16:58:12,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2024-10-13 16:58:12,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1781 states and 2844 transitions. [2024-10-13 16:58:12,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 263 [2024-10-13 16:58:12,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:12,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:12,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:12,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 13, 13, 13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:12,118 INFO L745 eck$LassoCheckResult]: Stem: 119963#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 119901#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 119902#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 119919#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 119964#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 119973#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 119970#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 119971#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 119986#$Ultimate##0 ~n := #in~n; 119987#L25 assume ~n <= 0;#res := 1; 119977#factFINAL assume true; 119978#factEXIT >#72#return; 119954#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 119955#$Ultimate##0 ~n := #in~n; 120385#L25 assume ~n <= 0;#res := 1; 120384#factFINAL assume true; 119975#factEXIT >#74#return; 119976#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 119989#$Ultimate##0 ~n := #in~n; 119985#L25 assume ~n <= 0;#res := 1; 119979#factFINAL assume true; 119980#factEXIT >#76#return; 120380#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 120378#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 120376#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120374#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120373#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 120370#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120371#$Ultimate##0 ~n := #in~n; 120396#L25 assume !(~n <= 0); 120347#L26 call #t~ret0 := fact(~n - 1);< 120393#$Ultimate##0 ~n := #in~n; 120398#L25 assume ~n <= 0;#res := 1; 120397#factFINAL assume true; 120392#factEXIT >#70#return; 120390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120388#factFINAL assume true; 120369#factEXIT >#78#return; 120330#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120334#$Ultimate##0 ~n := #in~n; 120341#L25 assume ~n <= 0;#res := 1; 120335#factFINAL assume true; 120328#factEXIT >#80#return; 120333#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120327#$Ultimate##0 ~n := #in~n; 120381#L25 assume !(~n <= 0); 120349#L26 call #t~ret0 := fact(~n - 1);< 120354#$Ultimate##0 ~n := #in~n; 120387#L25 assume ~n <= 0;#res := 1; 120386#factFINAL assume true; 120379#factEXIT >#70#return; 120377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120375#factFINAL assume true; 120366#factEXIT >#82#return; 120363#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 120361#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 120355#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120343#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 120337#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120340#$Ultimate##0 ~n := #in~n; 120360#L25 assume !(~n <= 0); 120348#L26 call #t~ret0 := fact(~n - 1);< 120354#$Ultimate##0 ~n := #in~n; 120372#L25 assume !(~n <= 0); 120350#L26 call #t~ret0 := fact(~n - 1);< 120365#$Ultimate##0 ~n := #in~n; 120368#L25 assume ~n <= 0;#res := 1; 120367#factFINAL assume true; 120364#factEXIT >#70#return; 120362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120356#factFINAL assume true; 120346#factEXIT >#70#return; 120344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120342#factFINAL assume true; 120336#factEXIT >#78#return; 120331#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120334#$Ultimate##0 ~n := #in~n; 120341#L25 assume ~n <= 0;#res := 1; 120335#factFINAL assume true; 120328#factEXIT >#80#return; 120326#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120327#$Ultimate##0 ~n := #in~n; 120381#L25 assume !(~n <= 0); 120349#L26 call #t~ret0 := fact(~n - 1);< 120354#$Ultimate##0 ~n := #in~n; 120372#L25 assume !(~n <= 0); 120350#L26 call #t~ret0 := fact(~n - 1);< 120365#$Ultimate##0 ~n := #in~n; 120368#L25 assume ~n <= 0;#res := 1; 120367#factFINAL assume true; 120364#factEXIT >#70#return; 120362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120356#factFINAL assume true; 120346#factEXIT >#70#return; 120352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120416#factFINAL assume true; 120414#factEXIT >#82#return; 120415#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 120454#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 120424#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120425#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120438#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 120502#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120503#$Ultimate##0 ~n := #in~n; 120590#L25 assume !(~n <= 0); 120579#L26 call #t~ret0 := fact(~n - 1);< 120601#$Ultimate##0 ~n := #in~n; 120617#L25 assume !(~n <= 0); 120582#L26 call #t~ret0 := fact(~n - 1);< 120616#$Ultimate##0 ~n := #in~n; 120617#L25 assume !(~n <= 0); 120582#L26 call #t~ret0 := fact(~n - 1);< 120616#$Ultimate##0 ~n := #in~n; 120613#L25 assume ~n <= 0;#res := 1; 120614#factFINAL assume true; 120638#factEXIT >#70#return; 120637#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120635#factFINAL assume true; 120599#factEXIT >#70#return; 120600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120587#factFINAL assume true; 120578#factEXIT >#70#return; 120576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120577#factFINAL assume true; 120567#factEXIT >#78#return; 120565#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120574#$Ultimate##0 ~n := #in~n; 120575#L25 assume ~n <= 0;#res := 1; 120564#factFINAL assume true; 120566#factEXIT >#80#return; 120515#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120632#$Ultimate##0 ~n := #in~n; 120631#L25 assume !(~n <= 0); 120514#L26 call #t~ret0 := fact(~n - 1);< 120516#$Ultimate##0 ~n := #in~n; 120612#L25 assume !(~n <= 0); 120581#L26 call #t~ret0 := fact(~n - 1);< 120601#$Ultimate##0 ~n := #in~n; 120617#L25 assume !(~n <= 0); 120582#L26 call #t~ret0 := fact(~n - 1);< 120616#$Ultimate##0 ~n := #in~n; 120613#L25 assume ~n <= 0;#res := 1; 120614#factFINAL assume true; 120638#factEXIT >#70#return; 120637#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120635#factFINAL assume true; 120599#factEXIT >#70#return; 120600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120587#factFINAL assume true; 120578#factEXIT >#70#return; 120584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120662#factFINAL assume true; 120659#factEXIT >#82#return; 120654#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 120655#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 120648#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120649#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120014#L43 [2024-10-13 16:58:12,118 INFO L747 eck$LassoCheckResult]: Loop: 120014#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 120008#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120009#$Ultimate##0 ~n := #in~n; 120034#L25 assume !(~n <= 0); 120019#L26 call #t~ret0 := fact(~n - 1);< 120023#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120058#L25 assume ~n <= 0;#res := 1; 120057#factFINAL assume true; 120055#factEXIT >#70#return; 120054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120053#factFINAL assume true; 120049#factEXIT >#70#return; 120048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120047#factFINAL assume true; 120045#factEXIT >#70#return; 120044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120043#factFINAL assume true; 120042#factEXIT >#70#return; 120041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120039#factFINAL assume true; 120030#factEXIT >#70#return; 120031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120040#factFINAL assume true; 120038#factEXIT >#70#return; 120037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120036#factFINAL assume true; 120033#factEXIT >#70#return; 120022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120027#factFINAL assume true; 120015#factEXIT >#70#return; 120013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120012#factFINAL assume true; 120007#factEXIT >#78#return; 120004#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120005#$Ultimate##0 ~n := #in~n; 120010#L25 assume ~n <= 0;#res := 1; 120006#factFINAL assume true; 120003#factEXIT >#80#return; 120001#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120002#$Ultimate##0 ~n := #in~n; 120035#L25 assume !(~n <= 0); 120016#L26 call #t~ret0 := fact(~n - 1);< 120032#$Ultimate##0 ~n := #in~n; 120051#L25 assume !(~n <= 0); 120020#L26 call #t~ret0 := fact(~n - 1);< 120028#$Ultimate##0 ~n := #in~n; 120052#L25 assume !(~n <= 0); 120021#L26 call #t~ret0 := fact(~n - 1);< 120046#$Ultimate##0 ~n := #in~n; 120059#L25 assume !(~n <= 0); 120018#L26 call #t~ret0 := fact(~n - 1);< 120050#$Ultimate##0 ~n := #in~n; 120060#L25 assume !(~n <= 0); 120017#L26 call #t~ret0 := fact(~n - 1);< 120056#$Ultimate##0 ~n := #in~n; 120058#L25 assume ~n <= 0;#res := 1; 120057#factFINAL assume true; 120055#factEXIT >#70#return; 120054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120053#factFINAL assume true; 120049#factEXIT >#70#return; 120048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120047#factFINAL assume true; 120045#factEXIT >#70#return; 120044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120043#factFINAL assume true; 120042#factEXIT >#70#return; 120041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120039#factFINAL assume true; 120030#factEXIT >#70#return; 120029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120011#factFINAL assume true; 120000#factEXIT >#82#return; 119999#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 119920#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 119921#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120026#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120014#L43 [2024-10-13 16:58:12,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1894920664, now seen corresponding path program 14 times [2024-10-13 16:58:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509196326] [2024-10-13 16:58:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769952315] [2024-10-13 16:58:12,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:12,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:12,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,169 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:12,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2024-10-13 16:58:12,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:12,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:12,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:12,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:12,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1035433092, now seen corresponding path program 16 times [2024-10-13 16:58:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477589966] [2024-10-13 16:58:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:12,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:58:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 16:58:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:58:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 181 proven. 199 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-13 16:58:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477589966] [2024-10-13 16:58:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477589966] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499765108] [2024-10-13 16:58:12,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:58:12,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:12,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,899 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2024-10-13 16:58:13,015 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:58:13,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:13,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 16:58:13,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 121 proven. 313 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 16:58:13,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 119 proven. 391 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-13 16:58:15,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499765108] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:15,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:15,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20, 31] total 51 [2024-10-13 16:58:15,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051940843] [2024-10-13 16:58:15,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:15,373 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 16:58:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=2061, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 16:58:15,374 INFO L87 Difference]: Start difference. First operand 1781 states and 2844 transitions. cyclomatic complexity: 1093 Second operand has 51 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 35 states have internal predecessors, (87), 25 states have call successors, (26), 1 states have call predecessors, (26), 15 states have return successors, (46), 32 states have call predecessors, (46), 25 states have call successors, (46) [2024-10-13 16:58:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:16,593 INFO L93 Difference]: Finished difference Result 2857 states and 5396 transitions. [2024-10-13 16:58:16,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2857 states and 5396 transitions. [2024-10-13 16:58:16,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 446 [2024-10-13 16:58:16,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2857 states to 2807 states and 5343 transitions. [2024-10-13 16:58:16,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 640 [2024-10-13 16:58:16,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 640 [2024-10-13 16:58:16,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2807 states and 5343 transitions. [2024-10-13 16:58:16,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:16,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2807 states and 5343 transitions. [2024-10-13 16:58:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states and 5343 transitions. [2024-10-13 16:58:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2011. [2024-10-13 16:58:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 1276 states have (on average 1.0705329153605017) internal successors, (1366), 1259 states have internal predecessors, (1366), 470 states have call successors, (470), 256 states have call predecessors, (470), 265 states have return successors, (1633), 495 states have call predecessors, (1633), 470 states have call successors, (1633) [2024-10-13 16:58:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 3469 transitions. [2024-10-13 16:58:16,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2011 states and 3469 transitions. [2024-10-13 16:58:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-13 16:58:16,677 INFO L425 stractBuchiCegarLoop]: Abstraction has 2011 states and 3469 transitions. [2024-10-13 16:58:16,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2024-10-13 16:58:16,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2011 states and 3469 transitions. [2024-10-13 16:58:16,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 287 [2024-10-13 16:58:16,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:16,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:16,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:16,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 16, 16, 16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:16,684 INFO L745 eck$LassoCheckResult]: Stem: 125707#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 125649#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 125650#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 125669#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 125708#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125722#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125720#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125717#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125728#$Ultimate##0 ~n := #in~n; 125726#L25 assume ~n <= 0;#res := 1; 125716#factFINAL assume true; 125718#factEXIT >#72#return; 125690#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125691#$Ultimate##0 ~n := #in~n; 125732#L25 assume ~n <= 0;#res := 1; 125731#factFINAL assume true; 125727#factEXIT >#74#return; 125724#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125875#$Ultimate##0 ~n := #in~n; 125897#L25 assume ~n <= 0;#res := 1; 125723#factFINAL assume true; 125725#factEXIT >#76#return; 125665#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125666#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 125868#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 125882#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125881#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125841#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125880#$Ultimate##0 ~n := #in~n; 125893#L25 assume !(~n <= 0); 125839#L26 call #t~ret0 := fact(~n - 1);< 125842#$Ultimate##0 ~n := #in~n; 125892#L25 assume ~n <= 0;#res := 1; 125891#factFINAL assume true; 125838#factEXIT >#70#return; 125840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125883#factFINAL assume true; 125879#factEXIT >#78#return; 125878#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125826#$Ultimate##0 ~n := #in~n; 125904#L25 assume ~n <= 0;#res := 1; 125900#factFINAL assume true; 125877#factEXIT >#80#return; 125873#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125874#$Ultimate##0 ~n := #in~n; 125908#L25 assume !(~n <= 0); 125856#L26 call #t~ret0 := fact(~n - 1);< 125888#$Ultimate##0 ~n := #in~n; 125909#L25 assume ~n <= 0;#res := 1; 125907#factFINAL assume true; 125903#factEXIT >#70#return; 125899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125876#factFINAL assume true; 125870#factEXIT >#82#return; 125869#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125867#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 125853#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 125837#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125834#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125828#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125832#$Ultimate##0 ~n := #in~n; 125863#L25 assume !(~n <= 0); 125858#L26 call #t~ret0 := fact(~n - 1);< 125888#$Ultimate##0 ~n := #in~n; 125894#L25 assume !(~n <= 0); 125857#L26 call #t~ret0 := fact(~n - 1);< 125902#$Ultimate##0 ~n := #in~n; 125906#L25 assume ~n <= 0;#res := 1; 125905#factFINAL assume true; 125901#factEXIT >#70#return; 125898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125854#factFINAL assume true; 125859#factEXIT >#70#return; 125835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125833#factFINAL assume true; 125827#factEXIT >#78#return; 125825#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125826#$Ultimate##0 ~n := #in~n; 125904#L25 assume ~n <= 0;#res := 1; 125900#factFINAL assume true; 125877#factEXIT >#80#return; 125871#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125874#$Ultimate##0 ~n := #in~n; 125908#L25 assume !(~n <= 0); 125856#L26 call #t~ret0 := fact(~n - 1);< 125888#$Ultimate##0 ~n := #in~n; 125894#L25 assume !(~n <= 0); 125857#L26 call #t~ret0 := fact(~n - 1);< 125902#$Ultimate##0 ~n := #in~n; 125906#L25 assume ~n <= 0;#res := 1; 125905#factFINAL assume true; 125901#factEXIT >#70#return; 125898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125854#factFINAL assume true; 125859#factEXIT >#70#return; 125887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126520#factFINAL assume true; 125912#factEXIT >#82#return; 125913#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125942#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 125941#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 125848#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125850#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126150#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126153#$Ultimate##0 ~n := #in~n; 126152#L25 assume !(~n <= 0); 126146#L26 call #t~ret0 := fact(~n - 1);< 126147#$Ultimate##0 ~n := #in~n; 126144#L25 assume !(~n <= 0); 126139#L26 call #t~ret0 := fact(~n - 1);< 126143#$Ultimate##0 ~n := #in~n; 126144#L25 assume !(~n <= 0); 126139#L26 call #t~ret0 := fact(~n - 1);< 126143#$Ultimate##0 ~n := #in~n; 126138#L25 assume ~n <= 0;#res := 1; 126140#factFINAL assume true; 126182#factEXIT >#70#return; 126181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126180#factFINAL assume true; 126179#factEXIT >#70#return; 126178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126177#factFINAL assume true; 126174#factEXIT >#70#return; 126173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126172#factFINAL assume true; 126170#factEXIT >#78#return; 126167#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126168#$Ultimate##0 ~n := #in~n; 126171#L25 assume ~n <= 0;#res := 1; 126169#factFINAL assume true; 126166#factEXIT >#80#return; 126164#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126165#$Ultimate##0 ~n := #in~n; 126482#L25 assume !(~n <= 0); 126149#L26 call #t~ret0 := fact(~n - 1);< 126155#$Ultimate##0 ~n := #in~n; 126154#L25 assume !(~n <= 0); 126145#L26 call #t~ret0 := fact(~n - 1);< 126147#$Ultimate##0 ~n := #in~n; 126144#L25 assume !(~n <= 0); 126139#L26 call #t~ret0 := fact(~n - 1);< 126143#$Ultimate##0 ~n := #in~n; 126138#L25 assume ~n <= 0;#res := 1; 126140#factFINAL assume true; 126182#factEXIT >#70#return; 126181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126180#factFINAL assume true; 126179#factEXIT >#70#return; 126178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126177#factFINAL assume true; 126174#factEXIT >#70#return; 126175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126519#factFINAL assume true; 126163#factEXIT >#82#return; 126162#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 126161#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 126159#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 126157#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125754#L43 [2024-10-13 16:58:16,684 INFO L747 eck$LassoCheckResult]: Loop: 125754#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125745#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125750#$Ultimate##0 ~n := #in~n; 125774#L25 assume !(~n <= 0); 125763#L26 call #t~ret0 := fact(~n - 1);< 125809#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125808#L25 assume ~n <= 0;#res := 1; 125805#factFINAL assume true; 125803#factEXIT >#70#return; 125801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125800#factFINAL assume true; 125798#factEXIT >#70#return; 125796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125795#factFINAL assume true; 125793#factEXIT >#70#return; 125791#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125790#factFINAL assume true; 125788#factEXIT >#70#return; 125786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125785#factFINAL assume true; 125783#factEXIT >#70#return; 125782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125781#factFINAL assume true; 125779#factEXIT >#70#return; 125778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125777#factFINAL assume true; 125776#factEXIT >#70#return; 125766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125772#factFINAL assume true; 125756#factEXIT >#70#return; 125753#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125749#factFINAL assume true; 125744#factEXIT >#78#return; 125747#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125752#$Ultimate##0 ~n := #in~n; 125771#L25 assume ~n <= 0;#res := 1; 125755#factFINAL assume true; 125751#factEXIT >#80#return; 125746#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125748#$Ultimate##0 ~n := #in~n; 125775#L25 assume !(~n <= 0); 125758#L26 call #t~ret0 := fact(~n - 1);< 125767#$Ultimate##0 ~n := #in~n; 125811#L25 assume !(~n <= 0); 125760#L26 call #t~ret0 := fact(~n - 1);< 125773#$Ultimate##0 ~n := #in~n; 125787#L25 assume !(~n <= 0); 125761#L26 call #t~ret0 := fact(~n - 1);< 125780#$Ultimate##0 ~n := #in~n; 125792#L25 assume !(~n <= 0); 125762#L26 call #t~ret0 := fact(~n - 1);< 125784#$Ultimate##0 ~n := #in~n; 125797#L25 assume !(~n <= 0); 125764#L26 call #t~ret0 := fact(~n - 1);< 125789#$Ultimate##0 ~n := #in~n; 125802#L25 assume !(~n <= 0); 125757#L26 call #t~ret0 := fact(~n - 1);< 125794#$Ultimate##0 ~n := #in~n; 125806#L25 assume !(~n <= 0); 125759#L26 call #t~ret0 := fact(~n - 1);< 125799#$Ultimate##0 ~n := #in~n; 125807#L25 assume !(~n <= 0); 125765#L26 call #t~ret0 := fact(~n - 1);< 125804#$Ultimate##0 ~n := #in~n; 125808#L25 assume ~n <= 0;#res := 1; 125805#factFINAL assume true; 125803#factEXIT >#70#return; 125801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125800#factFINAL assume true; 125798#factEXIT >#70#return; 125796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125795#factFINAL assume true; 125793#factEXIT >#70#return; 125791#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125790#factFINAL assume true; 125788#factEXIT >#70#return; 125786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125785#factFINAL assume true; 125783#factEXIT >#70#return; 125782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125781#factFINAL assume true; 125779#factEXIT >#70#return; 125778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125777#factFINAL assume true; 125776#factEXIT >#70#return; 125766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125772#factFINAL assume true; 125756#factEXIT >#70#return; 125753#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125749#factFINAL assume true; 125744#factEXIT >#82#return; 125743#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125670#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 125671#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 125770#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125754#L43 [2024-10-13 16:58:16,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1894920664, now seen corresponding path program 15 times [2024-10-13 16:58:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:16,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593801551] [2024-10-13 16:58:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700102004] [2024-10-13 16:58:16,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:16,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:16,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:16,701 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:16,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2024-10-13 16:58:16,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-10-13 16:58:16,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:16,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:16,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:16,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:16,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1262724228, now seen corresponding path program 17 times [2024-10-13 16:58:16,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:16,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720196694] [2024-10-13 16:58:16,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074581597] [2024-10-13 16:58:16,995 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:58:16,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:16,998 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:16,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2024-10-13 16:58:17,403 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-10-13 16:58:17,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:17,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:17,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 484763603, now seen corresponding path program 16 times [2024-10-13 16:58:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041589895] [2024-10-13 16:58:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:58:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 16:58:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:58:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 16:58:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 16:58:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 16:58:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 16:58:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 16:58:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-13 16:58:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4433 backedges. 590 proven. 309 refuted. 0 times theorem prover too weak. 3534 trivial. 0 not checked. [2024-10-13 16:58:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041589895] [2024-10-13 16:58:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041589895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881372964] [2024-10-13 16:58:17,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:58:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:17,826 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:17,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2024-10-13 16:58:18,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:58:18,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:18,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 16:58:18,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4433 backedges. 2226 proven. 83 refuted. 0 times theorem prover too weak. 2124 trivial. 0 not checked. [2024-10-13 16:58:18,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4433 backedges. 586 proven. 329 refuted. 0 times theorem prover too weak. 3518 trivial. 0 not checked. [2024-10-13 16:58:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881372964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:18,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 18] total 25 [2024-10-13 16:58:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495023393] [2024-10-13 16:58:18,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:19,178 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:19,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:19,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:19,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:19,178 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:19,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:19,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:19,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration32_Loop [2024-10-13 16:58:19,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:19,178 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:19,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,220 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:19,220 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:19,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,222 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-10-13 16:58:19,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,235 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,235 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-10-13 16:58:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,246 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-10-13 16:58:19,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,259 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,259 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-10-13 16:58:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,270 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-10-13 16:58:19,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,283 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,283 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2024-10-13 16:58:19,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,295 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-10-13 16:58:19,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,306 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,306 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,318 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-10-13 16:58:19,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,330 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,330 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,342 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-10-13 16:58:19,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,354 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,354 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-10-13 16:58:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,365 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-10-13 16:58:19,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,377 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,377 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,389 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-10-13 16:58:19,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,400 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:19,400 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:19,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-10-13 16:58:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,412 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-10-13 16:58:19,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:19,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-10-13 16:58:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,436 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-10-13 16:58:19,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:19,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:19,448 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:19,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,458 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:19,458 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:19,458 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:19,458 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:19,458 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:19,458 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,458 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:19,458 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:19,458 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration32_Loop [2024-10-13 16:58:19,458 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:19,458 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:19,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:19,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:19,502 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:19,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,503 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-10-13 16:58:19,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,526 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-10-13 16:58:19,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,553 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-10-13 16:58:19,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-13 16:58:19,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,578 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-10-13 16:58:19,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2024-10-13 16:58:19,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,605 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-10-13 16:58:19,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,628 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-10-13 16:58:19,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-10-13 16:58:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,653 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-10-13 16:58:19,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-10-13 16:58:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,678 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-10-13 16:58:19,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-10-13 16:58:19,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,701 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-10-13 16:58:19,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:19,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:19,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,728 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-10-13 16:58:19,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:19,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:19,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:19,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:19,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:19,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:19,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:19,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:19,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:19,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:19,743 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:19,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:19,744 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-10-13 16:58:19,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:19,745 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:19,745 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:19,745 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 17 Supporting invariants [] [2024-10-13 16:58:19,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2024-10-13 16:58:19,756 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:19,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:19,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 16:58:19,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:20,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:20,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-13 16:58:20,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 16:58:20,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2024-10-13 16:58:20,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2011 states and 3469 transitions. cyclomatic complexity: 1488 Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-13 16:58:21,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2011 states and 3469 transitions. cyclomatic complexity: 1488. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) Result 5031 states and 7968 transitions. Complement of second has 125 states. [2024-10-13 16:58:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 23 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-13 16:58:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 84 transitions. [2024-10-13 16:58:21,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 84 transitions. Stem has 158 letters. Loop has 116 letters. [2024-10-13 16:58:21,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:21,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 84 transitions. Stem has 274 letters. Loop has 116 letters. [2024-10-13 16:58:21,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:21,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 84 transitions. Stem has 158 letters. Loop has 232 letters. [2024-10-13 16:58:21,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:21,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5031 states and 7968 transitions. [2024-10-13 16:58:21,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 287 [2024-10-13 16:58:21,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5031 states to 2899 states and 4854 transitions. [2024-10-13 16:58:21,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 467 [2024-10-13 16:58:21,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 468 [2024-10-13 16:58:21,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2899 states and 4854 transitions. [2024-10-13 16:58:21,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:21,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2899 states and 4854 transitions. [2024-10-13 16:58:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states and 4854 transitions. [2024-10-13 16:58:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2417. [2024-10-13 16:58:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 1536 states have (on average 1.0696614583333333) internal successors, (1643), 1517 states have internal predecessors, (1643), 536 states have call successors, (536), 306 states have call predecessors, (536), 345 states have return successors, (1975), 593 states have call predecessors, (1975), 536 states have call successors, (1975) [2024-10-13 16:58:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 4154 transitions. [2024-10-13 16:58:21,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2417 states and 4154 transitions. [2024-10-13 16:58:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 16:58:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-10-13 16:58:21,326 INFO L87 Difference]: Start difference. First operand 2417 states and 4154 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 15 states have call successors, (27), 2 states have call predecessors, (27), 7 states have return successors, (33), 16 states have call predecessors, (33), 15 states have call successors, (33) [2024-10-13 16:58:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:21,710 INFO L93 Difference]: Finished difference Result 3080 states and 5986 transitions. [2024-10-13 16:58:21,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3080 states and 5986 transitions. [2024-10-13 16:58:21,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 776 [2024-10-13 16:58:21,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3080 states to 3060 states and 5946 transitions. [2024-10-13 16:58:21,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 957 [2024-10-13 16:58:21,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 957 [2024-10-13 16:58:21,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3060 states and 5946 transitions. [2024-10-13 16:58:21,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:21,753 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3060 states and 5946 transitions. [2024-10-13 16:58:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states and 5946 transitions. [2024-10-13 16:58:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2630. [2024-10-13 16:58:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 1651 states have (on average 1.075105996365839) internal successors, (1775), 1632 states have internal predecessors, (1775), 634 states have call successors, (634), 306 states have call predecessors, (634), 345 states have return successors, (2331), 691 states have call predecessors, (2331), 634 states have call successors, (2331) [2024-10-13 16:58:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 4740 transitions. [2024-10-13 16:58:21,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2630 states and 4740 transitions. [2024-10-13 16:58:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 16:58:21,811 INFO L425 stractBuchiCegarLoop]: Abstraction has 2630 states and 4740 transitions. [2024-10-13 16:58:21,812 INFO L332 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2024-10-13 16:58:21,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2630 states and 4740 transitions. [2024-10-13 16:58:21,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2024-10-13 16:58:21,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:21,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:21,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [25, 25, 15, 10, 10, 10, 10, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:21,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:21,821 INFO L745 eck$LassoCheckResult]: Stem: 141576#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 141477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 141478#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 141495#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 141577#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 141590#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141588#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141475#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141476#$Ultimate##0 ~n := #in~n; 141597#L25 assume ~n <= 0;#res := 1; 141598#factFINAL assume true; 141582#factEXIT >#72#return; 141583#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 142243#$Ultimate##0 ~n := #in~n; 142244#L25 assume ~n <= 0;#res := 1; 141599#factFINAL assume true; 141600#factEXIT >#74#return; 141457#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141458#$Ultimate##0 ~n := #in~n; 141601#L25 assume ~n <= 0;#res := 1; 141602#factFINAL assume true; 141584#factEXIT >#76#return; 141585#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 141506#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 141507#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143416#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143415#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 143407#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143412#$Ultimate##0 ~n := #in~n; 143410#L25 assume !(~n <= 0); 143327#L26 call #t~ret0 := fact(~n - 1);< 143408#$Ultimate##0 ~n := #in~n; 143562#L25 assume ~n <= 0;#res := 1; 143560#factFINAL assume true; 143558#factEXIT >#70#return; 143555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143553#factFINAL assume true; 143531#factEXIT >#78#return; 143301#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143302#$Ultimate##0 ~n := #in~n; 143308#L25 assume ~n <= 0;#res := 1; 143303#factFINAL assume true; 143307#factEXIT >#80#return; 143291#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143295#$Ultimate##0 ~n := #in~n; 143405#L25 assume !(~n <= 0); 143325#L26 call #t~ret0 := fact(~n - 1);< 143331#$Ultimate##0 ~n := #in~n; 143406#L25 assume ~n <= 0;#res := 1; 143404#factFINAL assume true; 143403#factEXIT >#70#return; 143402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143401#factFINAL assume true; 143289#factEXIT >#82#return; 143294#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 143396#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 143204#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143205#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 141580#L42-4 havoc main_~k~0#1; 141581#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 141966#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 141960#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141961#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141728#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141456#$Ultimate##0 ~n := #in~n; 141986#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#72#return; 141717#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141515#$Ultimate##0 ~n := #in~n; 141720#L25 assume ~n <= 0;#res := 1; 141985#factFINAL assume true; 141969#factEXIT >#74#return; 141547#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#76#return; 141936#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 141968#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 141964#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 141965#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141958#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141633#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141940#$Ultimate##0 ~n := #in~n; 141618#L25 assume !(~n <= 0); 141637#L26 call #t~ret0 := fact(~n - 1);< 141946#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#72#return; 141916#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141941#$Ultimate##0 ~n := #in~n; 141987#L25 assume !(~n <= 0); 141637#L26 call #t~ret0 := fact(~n - 1);< 141946#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#74#return; 141455#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141456#$Ultimate##0 ~n := #in~n; 141986#L25 assume ~n <= 0;#res := 1; 141985#factFINAL assume true; 141969#factEXIT >#76#return; 141983#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 142071#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 142070#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142068#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141568#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141508#L25 assume ~n <= 0;#res := 1; 141509#factFINAL assume true; 142023#factEXIT >#70#return; 142022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142021#factFINAL assume true; 142017#factEXIT >#70#return; 142015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142004#factFINAL assume true; 141997#factEXIT >#78#return; 141634#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141940#$Ultimate##0 ~n := #in~n; 141618#L25 assume !(~n <= 0); 141637#L26 call #t~ret0 := fact(~n - 1);< 141946#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#80#return; 141569#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#82#return; 141938#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 142063#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 142059#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142056#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 141610#L42-4 [2024-10-13 16:58:21,821 INFO L747 eck$LassoCheckResult]: Loop: 141610#L42-4 havoc main_~k~0#1; 141490#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 141488#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 141489#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142131#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141553#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141508#L25 assume ~n <= 0;#res := 1; 141509#factFINAL assume true; 142023#factEXIT >#70#return; 142022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142021#factFINAL assume true; 142017#factEXIT >#70#return; 142018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142020#factFINAL assume true; 142019#factEXIT >#70#return; 141503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141459#factFINAL assume true; 141441#factEXIT >#70#return; 141450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141994#factFINAL assume true; 141995#factEXIT >#72#return; 141715#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141515#$Ultimate##0 ~n := #in~n; 141720#L25 assume ~n <= 0;#res := 1; 141985#factFINAL assume true; 141969#factEXIT >#74#return; 141832#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141842#$Ultimate##0 ~n := #in~n; 141840#L25 assume !(~n <= 0); 141444#L26 call #t~ret0 := fact(~n - 1);< 141816#$Ultimate##0 ~n := #in~n; 141814#L25 assume !(~n <= 0); 141446#L26 call #t~ret0 := fact(~n - 1);< 141781#$Ultimate##0 ~n := #in~n; 141779#L25 assume !(~n <= 0); 141443#L26 call #t~ret0 := fact(~n - 1);< 141725#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141508#L25 assume ~n <= 0;#res := 1; 141509#factFINAL assume true; 142023#factEXIT >#70#return; 142022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142021#factFINAL assume true; 142017#factEXIT >#70#return; 142018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142020#factFINAL assume true; 142019#factEXIT >#70#return; 141503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141459#factFINAL assume true; 141441#factEXIT >#70#return; 141450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141994#factFINAL assume true; 141995#factEXIT >#76#return; 141956#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 142075#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 142074#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142073#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142072#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141560#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141508#L25 assume ~n <= 0;#res := 1; 141509#factFINAL assume true; 142023#factEXIT >#70#return; 142022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142021#factFINAL assume true; 142017#factEXIT >#70#return; 142015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142004#factFINAL assume true; 141997#factEXIT >#72#return; 141908#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141941#$Ultimate##0 ~n := #in~n; 141987#L25 assume ~n <= 0;#res := 1; 141985#factFINAL assume true; 141969#factEXIT >#74#return; 141537#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#76#return; 141935#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 142067#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 142066#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142065#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142064#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141533#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141508#L25 assume ~n <= 0;#res := 1; 141509#factFINAL assume true; 142023#factEXIT >#70#return; 142022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142021#factFINAL assume true; 142017#factEXIT >#70#return; 142015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142004#factFINAL assume true; 141997#factEXIT >#72#return; 141918#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141941#$Ultimate##0 ~n := #in~n; 141987#L25 assume !(~n <= 0); 141637#L26 call #t~ret0 := fact(~n - 1);< 141946#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#74#return; 141742#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141456#$Ultimate##0 ~n := #in~n; 141986#L25 assume ~n <= 0;#res := 1; 141985#factFINAL assume true; 141969#factEXIT >#76#return; 141970#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 142061#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 142060#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142058#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142057#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141566#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141722#L25 assume !(~n <= 0); 141448#L26 call #t~ret0 := fact(~n - 1);< 141721#$Ultimate##0 ~n := #in~n; 141508#L25 assume ~n <= 0;#res := 1; 141509#factFINAL assume true; 142023#factEXIT >#70#return; 142022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142021#factFINAL assume true; 142017#factEXIT >#70#return; 142015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142004#factFINAL assume true; 141997#factEXIT >#78#return; 141632#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141940#$Ultimate##0 ~n := #in~n; 141618#L25 assume !(~n <= 0); 141637#L26 call #t~ret0 := fact(~n - 1);< 141946#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#80#return; 141564#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141438#$Ultimate##0 ~n := #in~n; 141571#L25 assume !(~n <= 0); 141447#L26 call #t~ret0 := fact(~n - 1);< 141723#$Ultimate##0 ~n := #in~n; 141724#L25 assume ~n <= 0;#res := 1; 141945#factFINAL assume true; 141943#factEXIT >#70#return; 141942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141939#factFINAL assume true; 141876#factEXIT >#82#return; 141932#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 142053#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 142051#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142048#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 141610#L42-4 [2024-10-13 16:58:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1537405071, now seen corresponding path program 8 times [2024-10-13 16:58:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9345257] [2024-10-13 16:58:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:21,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 16:58:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 16:58:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 16:58:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 16:58:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 16:58:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 16:58:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 16:58:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 16:58:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-13 16:58:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 33 proven. 29 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2024-10-13 16:58:21,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9345257] [2024-10-13 16:58:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9345257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102966878] [2024-10-13 16:58:21,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:21,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:21,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:21,962 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:21,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Waiting until timeout for monitored process [2024-10-13 16:58:22,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:22,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:22,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:58:22,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 582 proven. 32 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-13 16:58:22,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2024-10-13 16:58:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102966878] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:22,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:22,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-10-13 16:58:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154836480] [2024-10-13 16:58:22,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:22,329 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1365613641, now seen corresponding path program 8 times [2024-10-13 16:58:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135717412] [2024-10-13 16:58:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 16:58:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 16:58:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 16:58:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 16:58:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 16:58:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 16:58:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 16:58:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 16:58:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 16:58:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 16:58:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-13 16:58:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-13 16:58:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 67 proven. 47 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2024-10-13 16:58:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135717412] [2024-10-13 16:58:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135717412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:22,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551702291] [2024-10-13 16:58:22,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:22,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:22,443 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:22,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2024-10-13 16:58:22,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:22,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:22,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 16:58:22,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 1186 proven. 171 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-13 16:58:22,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 130 proven. 616 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2024-10-13 16:58:23,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551702291] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:23,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 19] total 28 [2024-10-13 16:58:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064965327] [2024-10-13 16:58:23,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:23,317 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 16:58:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 16:58:23,318 INFO L87 Difference]: Start difference. First operand 2630 states and 4740 transitions. cyclomatic complexity: 2144 Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 9 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 9 states have call predecessors, (29), 9 states have call successors, (29) [2024-10-13 16:58:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:23,409 INFO L93 Difference]: Finished difference Result 2698 states and 4877 transitions. [2024-10-13 16:58:23,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2698 states and 4877 transitions. [2024-10-13 16:58:23,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 496 [2024-10-13 16:58:23,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2698 states to 2678 states and 4851 transitions. [2024-10-13 16:58:23,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 677 [2024-10-13 16:58:23,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 677 [2024-10-13 16:58:23,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2678 states and 4851 transitions. [2024-10-13 16:58:23,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:23,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2678 states and 4851 transitions. [2024-10-13 16:58:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states and 4851 transitions. [2024-10-13 16:58:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2630. [2024-10-13 16:58:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 1651 states have (on average 1.0745003028467595) internal successors, (1774), 1632 states have internal predecessors, (1774), 634 states have call successors, (634), 306 states have call predecessors, (634), 345 states have return successors, (2331), 691 states have call predecessors, (2331), 634 states have call successors, (2331) [2024-10-13 16:58:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 4739 transitions. [2024-10-13 16:58:23,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2630 states and 4739 transitions. [2024-10-13 16:58:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 16:58:23,495 INFO L425 stractBuchiCegarLoop]: Abstraction has 2630 states and 4739 transitions. [2024-10-13 16:58:23,495 INFO L332 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2024-10-13 16:58:23,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2630 states and 4739 transitions. [2024-10-13 16:58:23,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2024-10-13 16:58:23,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:23,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:23,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 17, 17, 17, 17, 15, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:23,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:23,506 INFO L745 eck$LassoCheckResult]: Stem: 149651#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 149600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 149601#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 149619#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 149652#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 149667#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149665#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 149598#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 149599#$Ultimate##0 ~n := #in~n; 149671#L25 assume ~n <= 0;#res := 1; 149662#factFINAL assume true; 149660#factEXIT >#72#return; 149661#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 149685#$Ultimate##0 ~n := #in~n; 149686#L25 assume ~n <= 0;#res := 1; 149674#factFINAL assume true; 149675#factEXIT >#74#return; 149669#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 149676#$Ultimate##0 ~n := #in~n; 149673#L25 assume ~n <= 0;#res := 1; 149668#factFINAL assume true; 149670#factEXIT >#76#return; 149615#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 149616#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 149898#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 149895#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149893#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 149890#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 149891#$Ultimate##0 ~n := #in~n; 149913#L25 assume !(~n <= 0); 149802#L26 call #t~ret0 := fact(~n - 1);< 149905#$Ultimate##0 ~n := #in~n; 149914#L25 assume ~n <= 0;#res := 1; 149912#factFINAL assume true; 149904#factEXIT >#70#return; 149903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149901#factFINAL assume true; 149889#factEXIT >#78#return; 149783#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 149787#$Ultimate##0 ~n := #in~n; 149857#L25 assume ~n <= 0;#res := 1; 149781#factFINAL assume true; 149786#factEXIT >#80#return; 149846#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 149849#$Ultimate##0 ~n := #in~n; 149881#L25 assume !(~n <= 0); 149800#L26 call #t~ret0 := fact(~n - 1);< 149806#$Ultimate##0 ~n := #in~n; 149902#L25 assume ~n <= 0;#res := 1; 149900#factFINAL assume true; 149888#factEXIT >#70#return; 149887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149886#factFINAL assume true; 149885#factEXIT >#82#return; 149884#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 149883#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 149882#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 149880#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149864#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 149793#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 149795#$Ultimate##0 ~n := #in~n; 149811#L25 assume !(~n <= 0); 149801#L26 call #t~ret0 := fact(~n - 1);< 149806#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149824#L25 assume ~n <= 0;#res := 1; 149823#factFINAL assume true; 149818#factEXIT >#70#return; 149812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149807#factFINAL assume true; 149798#factEXIT >#70#return; 149797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149796#factFINAL assume true; 149790#factEXIT >#78#return; 149785#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 149787#$Ultimate##0 ~n := #in~n; 149857#L25 assume ~n <= 0;#res := 1; 149781#factFINAL assume true; 149786#factEXIT >#80#return; 149843#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 149849#$Ultimate##0 ~n := #in~n; 149881#L25 assume !(~n <= 0); 149800#L26 call #t~ret0 := fact(~n - 1);< 149806#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149824#L25 assume ~n <= 0;#res := 1; 149823#factFINAL assume true; 149818#factEXIT >#70#return; 149812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149807#factFINAL assume true; 149798#factEXIT >#70#return; 149805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149850#factFINAL assume true; 149842#factEXIT >#82#return; 149841#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 149840#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 149839#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 149837#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149838#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 149792#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 149795#$Ultimate##0 ~n := #in~n; 149811#L25 assume !(~n <= 0); 149801#L26 call #t~ret0 := fact(~n - 1);< 149806#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149824#L25 assume ~n <= 0;#res := 1; 149823#factFINAL assume true; 149818#factEXIT >#70#return; 149812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149807#factFINAL assume true; 149798#factEXIT >#70#return; 149804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149944#factFINAL assume true; 149941#factEXIT >#70#return; 149943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149948#factFINAL assume true; 149947#factEXIT >#78#return; 149927#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 149931#$Ultimate##0 ~n := #in~n; 149933#L25 assume ~n <= 0;#res := 1; 149932#factFINAL assume true; 149926#factEXIT >#80#return; 149896#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 149916#$Ultimate##0 ~n := #in~n; 149917#L25 assume !(~n <= 0); 149809#L26 call #t~ret0 := fact(~n - 1);< 149894#$Ultimate##0 ~n := #in~n; 149892#L25 assume !(~n <= 0); 149803#L26 call #t~ret0 := fact(~n - 1);< 149810#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149824#L25 assume ~n <= 0;#res := 1; 149823#factFINAL assume true; 149818#factEXIT >#70#return; 149812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149807#factFINAL assume true; 149798#factEXIT >#70#return; 149804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149944#factFINAL assume true; 149941#factEXIT >#70#return; 149940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149939#factFINAL assume true; 149937#factEXIT >#70#return; 149876#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 150007#factFINAL assume true; 150004#factEXIT >#82#return; 149995#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 149996#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 149989#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 149990#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149980#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 149794#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 149795#$Ultimate##0 ~n := #in~n; 149811#L25 assume !(~n <= 0); 149801#L26 call #t~ret0 := fact(~n - 1);< 149806#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149824#L25 assume ~n <= 0;#res := 1; 149823#factFINAL assume true; 149818#factEXIT >#70#return; 149812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149807#factFINAL assume true; 149798#factEXIT >#70#return; 149797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149796#factFINAL assume true; 149790#factEXIT >#78#return; 149784#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 149787#$Ultimate##0 ~n := #in~n; 149857#L25 assume ~n <= 0;#res := 1; 149781#factFINAL assume true; 149786#factEXIT >#80#return; 149845#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 149849#$Ultimate##0 ~n := #in~n; 149881#L25 assume !(~n <= 0); 149800#L26 call #t~ret0 := fact(~n - 1);< 149806#$Ultimate##0 ~n := #in~n; 149830#L25 assume !(~n <= 0); 149799#L26 call #t~ret0 := fact(~n - 1);< 149829#$Ultimate##0 ~n := #in~n; 149824#L25 assume ~n <= 0;#res := 1; 149823#factFINAL assume true; 149818#factEXIT >#70#return; 149812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149807#factFINAL assume true; 149798#factEXIT >#70#return; 149805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149850#factFINAL assume true; 149842#factEXIT >#82#return; 149847#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 149960#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 149945#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 149946#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149704#L43 [2024-10-13 16:58:23,506 INFO L747 eck$LassoCheckResult]: Loop: 149704#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 149698#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 149699#$Ultimate##0 ~n := #in~n; 149726#L25 assume !(~n <= 0); 149711#L26 call #t~ret0 := fact(~n - 1);< 149716#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149762#L25 assume ~n <= 0;#res := 1; 149759#factFINAL assume true; 149757#factEXIT >#70#return; 149755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149754#factFINAL assume true; 149752#factEXIT >#70#return; 149751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149749#factFINAL assume true; 149747#factEXIT >#70#return; 149745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149744#factFINAL assume true; 149742#factEXIT >#70#return; 149740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149739#factFINAL assume true; 149737#factEXIT >#70#return; 149736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149734#factFINAL assume true; 149732#factEXIT >#70#return; 149731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149730#factFINAL assume true; 149729#factEXIT >#70#return; 149728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149725#factFINAL assume true; 149723#factEXIT >#70#return; 149715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149720#factFINAL assume true; 149705#factEXIT >#70#return; 149703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149702#factFINAL assume true; 149697#factEXIT >#78#return; 149694#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 149695#$Ultimate##0 ~n := #in~n; 149700#L25 assume ~n <= 0;#res := 1; 149696#factFINAL assume true; 149693#factEXIT >#80#return; 149691#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 149692#$Ultimate##0 ~n := #in~n; 149727#L25 assume !(~n <= 0); 149712#L26 call #t~ret0 := fact(~n - 1);< 149724#$Ultimate##0 ~n := #in~n; 149735#L25 assume !(~n <= 0); 149714#L26 call #t~ret0 := fact(~n - 1);< 149721#$Ultimate##0 ~n := #in~n; 149741#L25 assume !(~n <= 0); 149713#L26 call #t~ret0 := fact(~n - 1);< 149733#$Ultimate##0 ~n := #in~n; 149746#L25 assume !(~n <= 0); 149706#L26 call #t~ret0 := fact(~n - 1);< 149738#$Ultimate##0 ~n := #in~n; 149750#L25 assume !(~n <= 0); 149707#L26 call #t~ret0 := fact(~n - 1);< 149743#$Ultimate##0 ~n := #in~n; 149756#L25 assume !(~n <= 0); 149710#L26 call #t~ret0 := fact(~n - 1);< 149748#$Ultimate##0 ~n := #in~n; 149760#L25 assume !(~n <= 0); 149708#L26 call #t~ret0 := fact(~n - 1);< 149753#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149761#L25 assume !(~n <= 0); 149709#L26 call #t~ret0 := fact(~n - 1);< 149758#$Ultimate##0 ~n := #in~n; 149762#L25 assume ~n <= 0;#res := 1; 149759#factFINAL assume true; 149757#factEXIT >#70#return; 149755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149754#factFINAL assume true; 149752#factEXIT >#70#return; 149751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149749#factFINAL assume true; 149747#factEXIT >#70#return; 149745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149744#factFINAL assume true; 149742#factEXIT >#70#return; 149740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149739#factFINAL assume true; 149737#factEXIT >#70#return; 149736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149734#factFINAL assume true; 149732#factEXIT >#70#return; 149731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149730#factFINAL assume true; 149729#factEXIT >#70#return; 149728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149725#factFINAL assume true; 149723#factEXIT >#70#return; 149715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149720#factFINAL assume true; 149705#factEXIT >#70#return; 149703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 149702#factFINAL assume true; 149697#factEXIT >#82#return; 149689#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 149620#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 149621#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 149719#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 149704#L43 [2024-10-13 16:58:23,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -79960557, now seen corresponding path program 17 times [2024-10-13 16:58:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018186328] [2024-10-13 16:58:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:58:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 16:58:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:58:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 16:58:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 16:58:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 16:58:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 16:58:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 16:58:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-13 16:58:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 376 proven. 146 refuted. 0 times theorem prover too weak. 1799 trivial. 0 not checked. [2024-10-13 16:58:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018186328] [2024-10-13 16:58:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018186328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:23,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737296064] [2024-10-13 16:58:23,889 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:58:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:23,896 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2024-10-13 16:58:24,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2024-10-13 16:58:24,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:24,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:24,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 1193 proven. 147 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2024-10-13 16:58:24,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 389 proven. 323 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2024-10-13 16:58:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737296064] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:24,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 19] total 30 [2024-10-13 16:58:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063581942] [2024-10-13 16:58:24,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:24,865 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -980333444, now seen corresponding path program 18 times [2024-10-13 16:58:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667576638] [2024-10-13 16:58:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:24,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 16:58:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899934525] [2024-10-13 16:58:24,874 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:58:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:24,877 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:24,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2024-10-13 16:58:26,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2024-10-13 16:58:26,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 16:58:26,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:26,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:26,557 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:26,557 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:26,557 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:26,557 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:26,557 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:26,557 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,557 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:26,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:26,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2024-10-13 16:58:26,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:26,557 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:26,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,600 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:26,600 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,601 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-10-13 16:58:26,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:26,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:26,613 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:26,614 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:26,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:26,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,625 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2024-10-13 16:58:26,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:26,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:26,637 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:26,638 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:26,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:26,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,649 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-10-13 16:58:26,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:26,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:26,669 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:26,669 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=10} Honda state: {ULTIMATE.start_main_~x~0#1=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:58:26,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2024-10-13 16:58:26,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,681 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-10-13 16:58:26,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:26,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:26,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2024-10-13 16:58:26,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,705 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-10-13 16:58:26,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:26,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:26,718 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:26,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2024-10-13 16:58:26,729 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:26,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:26,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:26,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:26,729 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:26,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,729 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:26,729 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:26,729 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2024-10-13 16:58:26,729 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:26,729 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:26,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:26,788 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:26,789 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:26,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,791 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2024-10-13 16:58:26,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:26,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:26,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:26,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:26,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:26,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:26,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:26,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:26,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:26,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2024-10-13 16:58:26,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,815 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2024-10-13 16:58:26,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:26,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:26,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:26,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:26,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:26,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:26,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:26,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:26,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:26,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:26,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,840 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2024-10-13 16:58:26,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:26,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:26,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:26,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:26,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:26,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:26,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:26,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:26,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:26,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2024-10-13 16:58:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,864 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2024-10-13 16:58:26,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:58:26,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:26,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:26,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:26,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:26,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:26,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:26,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:26,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:26,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:26,879 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:26,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:26,880 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:26,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2024-10-13 16:58:26,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:26,881 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:26,881 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:26,882 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 19 Supporting invariants [] [2024-10-13 16:58:26,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2024-10-13 16:58:26,893 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:26,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:27,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-13 16:58:27,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:27,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2024-10-13 16:58:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:27,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-13 16:58:27,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 0 proven. 618 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-10-13 16:58:28,308 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 16 loop predicates [2024-10-13 16:58:28,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2630 states and 4739 transitions. cyclomatic complexity: 2143 Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 6 states have call successors, (12), 2 states have call predecessors, (12), 12 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-13 16:58:28,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2630 states and 4739 transitions. cyclomatic complexity: 2143. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 6 states have call successors, (12), 2 states have call predecessors, (12), 12 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) Result 6627 states and 10797 transitions. Complement of second has 137 states. [2024-10-13 16:58:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 27 states 1 stem states 25 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 6 states have call successors, (12), 2 states have call predecessors, (12), 12 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-13 16:58:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 90 transitions. [2024-10-13 16:58:28,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 90 transitions. Stem has 208 letters. Loop has 128 letters. [2024-10-13 16:58:28,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:28,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 90 transitions. Stem has 336 letters. Loop has 128 letters. [2024-10-13 16:58:28,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:28,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 90 transitions. Stem has 208 letters. Loop has 256 letters. [2024-10-13 16:58:28,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:28,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6627 states and 10797 transitions. [2024-10-13 16:58:28,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2024-10-13 16:58:28,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6627 states to 3796 states and 6554 transitions. [2024-10-13 16:58:28,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 638 [2024-10-13 16:58:28,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 639 [2024-10-13 16:58:28,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3796 states and 6554 transitions. [2024-10-13 16:58:28,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:28,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3796 states and 6554 transitions. [2024-10-13 16:58:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states and 6554 transitions. [2024-10-13 16:58:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 2898. [2024-10-13 16:58:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 1829 states have (on average 1.0776380535811918) internal successors, (1971), 1808 states have internal predecessors, (1971), 670 states have call successors, (670), 336 states have call predecessors, (670), 399 states have return successors, (2665), 753 states have call predecessors, (2665), 670 states have call successors, (2665) [2024-10-13 16:58:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 5306 transitions. [2024-10-13 16:58:28,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2898 states and 5306 transitions. [2024-10-13 16:58:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 16:58:28,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2024-10-13 16:58:28,888 INFO L87 Difference]: Start difference. First operand 2898 states and 5306 transitions. Second operand has 30 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 states have internal predecessors, (82), 17 states have call successors, (38), 2 states have call predecessors, (38), 8 states have return successors, (42), 18 states have call predecessors, (42), 17 states have call successors, (42) [2024-10-13 16:58:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:29,527 INFO L93 Difference]: Finished difference Result 3034 states and 5628 transitions. [2024-10-13 16:58:29,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3034 states and 5628 transitions. [2024-10-13 16:58:29,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 550 [2024-10-13 16:58:29,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3034 states to 3024 states and 5604 transitions. [2024-10-13 16:58:29,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 740 [2024-10-13 16:58:29,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 740 [2024-10-13 16:58:29,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3024 states and 5604 transitions. [2024-10-13 16:58:29,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:29,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3024 states and 5604 transitions. [2024-10-13 16:58:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states and 5604 transitions. [2024-10-13 16:58:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 3004. [2024-10-13 16:58:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 1882 states have (on average 1.0802337938363442) internal successors, (2033), 1861 states have internal predecessors, (2033), 719 states have call successors, (719), 336 states have call predecessors, (719), 403 states have return successors, (2818), 806 states have call predecessors, (2818), 719 states have call successors, (2818) [2024-10-13 16:58:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 5570 transitions. [2024-10-13 16:58:29,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3004 states and 5570 transitions. [2024-10-13 16:58:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 16:58:29,611 INFO L425 stractBuchiCegarLoop]: Abstraction has 3004 states and 5570 transitions. [2024-10-13 16:58:29,611 INFO L332 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2024-10-13 16:58:29,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3004 states and 5570 transitions. [2024-10-13 16:58:29,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 536 [2024-10-13 16:58:29,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:29,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:29,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [31, 31, 16, 16, 16, 16, 15, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:29,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:29,620 INFO L745 eck$LassoCheckResult]: Stem: 167768#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 167699#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 167700#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 167718#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 167769#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 167786#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 167784#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 167781#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 167793#$Ultimate##0 ~n := #in~n; 167794#L25 assume ~n <= 0;#res := 1; 167780#factFINAL assume true; 167782#factEXIT >#72#return; 167739#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 167740#$Ultimate##0 ~n := #in~n; 167801#L25 assume ~n <= 0;#res := 1; 167802#factFINAL assume true; 167792#factEXIT >#74#return; 167788#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 167799#$Ultimate##0 ~n := #in~n; 167800#L25 assume ~n <= 0;#res := 1; 167787#factFINAL assume true; 167789#factEXIT >#76#return; 167714#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 167715#binomialCoefficient_returnLabel#1 main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 168356#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 168355#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 168354#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 168351#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 168353#$Ultimate##0 ~n := #in~n; 168352#L25 assume !(~n <= 0); 168346#L26 call #t~ret0 := fact(~n - 1);< 168349#$Ultimate##0 ~n := #in~n; 168345#L25 assume ~n <= 0;#res := 1; 168347#factFINAL assume true; 168423#factEXIT >#70#return; 168422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168421#factFINAL assume true; 168419#factEXIT >#78#return; 168397#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 168400#$Ultimate##0 ~n := #in~n; 168403#L25 assume ~n <= 0;#res := 1; 168401#factFINAL assume true; 168395#factEXIT >#80#return; 168391#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 168394#$Ultimate##0 ~n := #in~n; 168420#L25 assume !(~n <= 0); 168372#L26 call #t~ret0 := fact(~n - 1);< 168338#$Ultimate##0 ~n := #in~n; 168425#L25 assume ~n <= 0;#res := 1; 168424#factFINAL assume true; 168418#factEXIT >#70#return; 168417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168416#factFINAL assume true; 168415#factEXIT >#82#return; 168414#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 168413#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 168411#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 168407#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 168405#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 168334#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 168363#$Ultimate##0 ~n := #in~n; 168344#L25 assume !(~n <= 0); 168333#L26 call #t~ret0 := fact(~n - 1);< 168338#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168366#L25 assume ~n <= 0;#res := 1; 168367#factFINAL assume true; 168359#factEXIT >#70#return; 168361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168412#factFINAL assume true; 168408#factEXIT >#70#return; 168406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168404#factFINAL assume true; 168402#factEXIT >#78#return; 168398#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 168400#$Ultimate##0 ~n := #in~n; 168403#L25 assume ~n <= 0;#res := 1; 168401#factFINAL assume true; 168395#factEXIT >#80#return; 168389#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 168394#$Ultimate##0 ~n := #in~n; 168420#L25 assume !(~n <= 0); 168372#L26 call #t~ret0 := fact(~n - 1);< 168338#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168366#L25 assume ~n <= 0;#res := 1; 168367#factFINAL assume true; 168359#factEXIT >#70#return; 168361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168412#factFINAL assume true; 168408#factEXIT >#70#return; 168409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168427#factFINAL assume true; 168387#factEXIT >#82#return; 168386#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 168385#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 168382#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 168379#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 168380#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 168335#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 168363#$Ultimate##0 ~n := #in~n; 168344#L25 assume !(~n <= 0); 168333#L26 call #t~ret0 := fact(~n - 1);< 168338#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168366#L25 assume ~n <= 0;#res := 1; 168367#factFINAL assume true; 168359#factEXIT >#70#return; 168361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168412#factFINAL assume true; 168408#factEXIT >#70#return; 168410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168508#factFINAL assume true; 168437#factEXIT >#70#return; 168439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168522#factFINAL assume true; 168520#factEXIT >#78#return; 168515#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 168517#$Ultimate##0 ~n := #in~n; 168519#L25 assume ~n <= 0;#res := 1; 168518#factFINAL assume true; 168513#factEXIT >#80#return; 168447#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 168485#$Ultimate##0 ~n := #in~n; 168486#L25 assume !(~n <= 0); 168341#L26 call #t~ret0 := fact(~n - 1);< 168446#$Ultimate##0 ~n := #in~n; 168445#L25 assume !(~n <= 0); 168340#L26 call #t~ret0 := fact(~n - 1);< 168343#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168366#L25 assume ~n <= 0;#res := 1; 168367#factFINAL assume true; 168359#factEXIT >#70#return; 168361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168412#factFINAL assume true; 168408#factEXIT >#70#return; 168410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168508#factFINAL assume true; 168437#factEXIT >#70#return; 168440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168587#factFINAL assume true; 168529#factEXIT >#82#return; 168530#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 168563#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 168562#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 168561#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 168482#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 168336#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 168363#$Ultimate##0 ~n := #in~n; 168344#L25 assume !(~n <= 0); 168333#L26 call #t~ret0 := fact(~n - 1);< 168338#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168366#L25 assume ~n <= 0;#res := 1; 168367#factFINAL assume true; 168359#factEXIT >#70#return; 168361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168412#factFINAL assume true; 168408#factEXIT >#70#return; 168406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168404#factFINAL assume true; 168402#factEXIT >#78#return; 168396#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 168400#$Ultimate##0 ~n := #in~n; 168403#L25 assume ~n <= 0;#res := 1; 168401#factFINAL assume true; 168395#factEXIT >#80#return; 168388#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 168394#$Ultimate##0 ~n := #in~n; 168420#L25 assume !(~n <= 0); 168372#L26 call #t~ret0 := fact(~n - 1);< 168338#$Ultimate##0 ~n := #in~n; 168350#L25 assume !(~n <= 0); 168360#L26 call #t~ret0 := fact(~n - 1);< 168369#$Ultimate##0 ~n := #in~n; 168366#L25 assume ~n <= 0;#res := 1; 168367#factFINAL assume true; 168359#factEXIT >#70#return; 168361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168412#factFINAL assume true; 168408#factEXIT >#70#return; 168409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168427#factFINAL assume true; 168387#factEXIT >#82#return; 168392#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 168443#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 168435#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 168436#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 167852#L43 [2024-10-13 16:58:29,624 INFO L747 eck$LassoCheckResult]: Loop: 167852#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 167850#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 167851#$Ultimate##0 ~n := #in~n; 167885#L25 assume !(~n <= 0); 167874#L26 call #t~ret0 := fact(~n - 1);< 167884#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167894#L25 assume ~n <= 0;#res := 1; 168061#factFINAL assume true; 168060#factEXIT >#70#return; 168059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168058#factFINAL assume true; 168057#factEXIT >#70#return; 168056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168055#factFINAL assume true; 168054#factEXIT >#70#return; 168052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168046#factFINAL assume true; 168045#factEXIT >#70#return; 168044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168041#factFINAL assume true; 168039#factEXIT >#70#return; 168020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168019#factFINAL assume true; 168018#factEXIT >#70#return; 168016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168014#factFINAL assume true; 168012#factEXIT >#70#return; 168010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168008#factFINAL assume true; 167872#factEXIT >#70#return; 167880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168049#factFINAL assume true; 167996#factEXIT >#70#return; 167883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 167887#factFINAL assume true; 167882#factEXIT >#70#return; 167871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 167869#factFINAL assume true; 167866#factEXIT >#78#return; 167863#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 167864#$Ultimate##0 ~n := #in~n; 167867#L25 assume ~n <= 0;#res := 1; 167865#factFINAL assume true; 167862#factEXIT >#80#return; 167860#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 167861#$Ultimate##0 ~n := #in~n; 167886#L25 assume !(~n <= 0); 167877#L26 call #t~ret0 := fact(~n - 1);< 167881#$Ultimate##0 ~n := #in~n; 167908#L25 assume !(~n <= 0); 167879#L26 call #t~ret0 := fact(~n - 1);< 167888#$Ultimate##0 ~n := #in~n; 167903#L25 assume !(~n <= 0); 167873#L26 call #t~ret0 := fact(~n - 1);< 167900#$Ultimate##0 ~n := #in~n; 167898#L25 assume !(~n <= 0); 167876#L26 call #t~ret0 := fact(~n - 1);< 167897#$Ultimate##0 ~n := #in~n; 167896#L25 assume !(~n <= 0); 167875#L26 call #t~ret0 := fact(~n - 1);< 167895#$Ultimate##0 ~n := #in~n; 167893#L25 assume !(~n <= 0); 167841#L26 call #t~ret0 := fact(~n - 1);< 167891#$Ultimate##0 ~n := #in~n; 167840#L25 assume !(~n <= 0); 167842#L26 call #t~ret0 := fact(~n - 1);< 167890#$Ultimate##0 ~n := #in~n; 167892#L25 assume !(~n <= 0); 167878#L26 call #t~ret0 := fact(~n - 1);< 167889#$Ultimate##0 ~n := #in~n; 167894#L25 assume ~n <= 0;#res := 1; 168061#factFINAL assume true; 168060#factEXIT >#70#return; 168059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168058#factFINAL assume true; 168057#factEXIT >#70#return; 168056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168055#factFINAL assume true; 168054#factEXIT >#70#return; 168052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168046#factFINAL assume true; 168045#factEXIT >#70#return; 168044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168041#factFINAL assume true; 168039#factEXIT >#70#return; 168020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168019#factFINAL assume true; 168018#factEXIT >#70#return; 168016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168014#factFINAL assume true; 168012#factEXIT >#70#return; 168010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 168008#factFINAL assume true; 167872#factEXIT >#70#return; 167870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 167868#factFINAL assume true; 167859#factEXIT >#82#return; 167858#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 167857#binomialCoefficient_returnLabel#2 main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true; 167856#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 167855#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 167852#L43 [2024-10-13 16:58:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1049202349, now seen corresponding path program 18 times [2024-10-13 16:58:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:29,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180446167] [2024-10-13 16:58:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:58:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 16:58:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 16:58:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 16:58:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 16:58:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 16:58:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 16:58:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 16:58:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 16:58:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 16:58:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 16:58:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 16:58:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 16:58:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 16:58:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 16:58:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 326 proven. 54 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2024-10-13 16:58:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180446167] [2024-10-13 16:58:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180446167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378980157] [2024-10-13 16:58:29,849 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:58:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:29,851 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:29,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Waiting until timeout for monitored process [2024-10-13 16:58:30,195 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2024-10-13 16:58:30,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:30,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 16:58:30,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 364 proven. 16 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2024-10-13 16:58:30,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 364 proven. 20 refuted. 0 times theorem prover too weak. 1781 trivial. 0 not checked. [2024-10-13 16:58:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378980157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:30,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 32 [2024-10-13 16:58:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215802007] [2024-10-13 16:58:30,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:30,678 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1169955260, now seen corresponding path program 19 times [2024-10-13 16:58:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575848945] [2024-10-13 16:58:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:58:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 16:58:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 16:58:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 16:58:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 237 proven. 403 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2024-10-13 16:58:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575848945] [2024-10-13 16:58:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575848945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639292833] [2024-10-13 16:58:31,446 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 16:58:31,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:31,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:31,448 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:31,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Waiting until timeout for monitored process [2024-10-13 16:58:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:31,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 16:58:31,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 185 proven. 595 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-10-13 16:58:31,840 INFO L311 TraceCheckSpWp]: Computing backward predicates...