./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f 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 ../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-assert-order-craig-803cd42-m [2024-11-23 02:06:28,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:06:28,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-23 02:06:28,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:06:28,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:06:28,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:06:28,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:06:28,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:06:28,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:06:28,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:06:28,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:06:28,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:06:28,481 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:06:28,481 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:06:28,484 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:06:28,484 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:06:28,484 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:06:28,485 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:06:28,485 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:06:28,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:06:28,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:06:28,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:06:28,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:06:28,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:06:28,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:06:28,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:06:28,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:06:28,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:06:28,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:06:28,489 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:06:28,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:06:28,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:06:28,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:06:28,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:06:28,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:06:28,491 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:06:28,491 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-11-23 02:06:28,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:06:28,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:06:28,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:06:28,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:06:28,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:06:28,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-23 02:06:29,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:06:30,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:06:30,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-23 02:06:30,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15aa1b93/71438d0b7deb4778b365a46549ba4441/FLAGccfecd9fd [2024-11-23 02:06:30,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15aa1b93/71438d0b7deb4778b365a46549ba4441 [2024-11-23 02:06:30,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:06:30,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:06:30,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:06:30,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:06:30,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:06:30,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef36290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30, skipping insertion in model container [2024-11-23 02:06:30,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:06:30,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:06:30,302 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:06:30,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:06:30,326 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:06:30,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30 WrapperNode [2024-11-23 02:06:30,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:06:30,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:06:30,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:06:30,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:06:30,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,352 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-23 02:06:30,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:06:30,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:06:30,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:06:30,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:06:30,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,367 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 02:06:30,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:06:30,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:06:30,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:06:30,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:06:30,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (1/1) ... [2024-11-23 02:06:30,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:30,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:30,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:30,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:06:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2024-11-23 02:06:30,441 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2024-11-23 02:06:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:06:30,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:06:30,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:06:30,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:06:30,598 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-23 02:06:30,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:06:30,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:06:30,608 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 02:06:30,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:30 BoogieIcfgContainer [2024-11-23 02:06:30,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:06:30,609 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:06:30,609 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:06:30,613 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:06:30,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:06:30,614 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:06:30" (1/3) ... [2024-11-23 02:06:30,615 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b600912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:06:30, skipping insertion in model container [2024-11-23 02:06:30,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:06:30,615 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:30" (2/3) ... [2024-11-23 02:06:30,615 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b600912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:06:30, skipping insertion in model container [2024-11-23 02:06:30,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:06:30,615 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:30" (3/3) ... [2024-11-23 02:06:30,617 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2024-11-23 02:06:30,657 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:06:30,657 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:06:30,658 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:06:30,658 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:06:30,658 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:06:30,658 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:06:30,658 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:06:30,658 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:06:30,661 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-11-23 02:06:30,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-23 02:06:30,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:30,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:30,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:06:30,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:06:30,682 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:06:30,683 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-11-23 02:06:30,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-23 02:06:30,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:30,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:30,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:06:30,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:06:30,691 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-11-23 02:06:30,691 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-11-23 02:06:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2024-11-23 02:06:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:30,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182773503] [2024-11-23 02:06:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:30,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:30,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1792233, now seen corresponding path program 1 times [2024-11-23 02:06:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531900428] [2024-11-23 02:06:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:30,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:30,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:30,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -15995056, now seen corresponding path program 1 times [2024-11-23 02:06:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095701389] [2024-11-23 02:06:30,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:06:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095701389] [2024-11-23 02:06:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095701389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:30,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:06:30,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:06:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800149828] [2024-11-23 02:06:30,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:30,979 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:30,979 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:30,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:30,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:30,980 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:30,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:30,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:30,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:30,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-11-23 02:06:30,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:30,981 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:30,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:31,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:31,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:31,059 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:31,060 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:31,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,068 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-11-23 02:06:31,070 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-11-23 02:06:31,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:31,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:31,088 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:31,088 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-11-23 02:06:31,096 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-11-23 02:06:31,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,101 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-11-23 02:06:31,102 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-11-23 02:06:31,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:31,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:31,115 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:31,116 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-11-23 02:06:31,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-23 02:06:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,124 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-11-23 02:06:31,127 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-11-23 02:06:31,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:31,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:31,146 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-11-23 02:06:31,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:31,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:06:31,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:31,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:31,215 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:31,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 02:06:31,221 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:31,221 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:31,221 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:31,221 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:31,221 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:31,221 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,221 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:31,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:31,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-11-23 02:06:31,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:31,222 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:31,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:31,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:31,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:31,263 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:31,266 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:31,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:31,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 02:06:31,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:31,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:31,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:31,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:31,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:31,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:31,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:31,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:31,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:31,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-23 02:06:31,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,320 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:31,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-23 02:06:31,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:31,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:31,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:31,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:31,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:31,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:31,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:31,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:31,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:31,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-23 02:06:31,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,375 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:31,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 02:06:31,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:31,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:31,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:31,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:31,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:31,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:31,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:31,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:31,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:31,402 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-23 02:06:31,402 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-23 02:06:31,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:31,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:31,429 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:31,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 02:06:31,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:31,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:31,433 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:31,433 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-11-23 02:06:31,439 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-11-23 02:06:31,442 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:31,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:31,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:06:31,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:31,497 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:06:31,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:06:31,602 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-11-23 02:06:31,603 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-11-23 02:06:31,691 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-11-23 02:06:31,692 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-11-23 02:06:31,696 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-11-23 02:06:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2024-11-23 02:06:31,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-23 02:06:31,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:31,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-23 02:06:31,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:31,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 8 letters. [2024-11-23 02:06:31,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:31,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 107 transitions. [2024-11-23 02:06:31,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-23 02:06:31,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 35 states and 50 transitions. [2024-11-23 02:06:31,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-23 02:06:31,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-23 02:06:31,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2024-11-23 02:06:31,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:31,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-11-23 02:06:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2024-11-23 02:06:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-23 02:06:31,734 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-11-23 02:06:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-11-23 02:06:31,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-11-23 02:06:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:06:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:06:31,739 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-11-23 02:06:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:31,799 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-11-23 02:06:31,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2024-11-23 02:06:31,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-23 02:06:31,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2024-11-23 02:06:31,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-23 02:06:31,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-23 02:06:31,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-11-23 02:06:31,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:06:31,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-23 02:06:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-11-23 02:06:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-23 02:06:31,806 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-11-23 02:06:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-23 02:06:31,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-23 02:06:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:06:31,809 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-23 02:06:31,809 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:06:31,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-11-23 02:06:31,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-23 02:06:31,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:31,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:31,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:06:31,812 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-11-23 02:06:31,812 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-11-23 02:06:31,813 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-11-23 02:06:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2024-11-23 02:06:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357811437] [2024-11-23 02:06:31,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:31,820 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:06:31,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:31,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:31,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:31,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2022384732, now seen corresponding path program 1 times [2024-11-23 02:06:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290290000] [2024-11-23 02:06:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-23 02:06:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290290000] [2024-11-23 02:06:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290290000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:31,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:06:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:06:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35268295] [2024-11-23 02:06:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:31,995 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:06:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:06:31,996 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-11-23 02:06:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:32,061 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2024-11-23 02:06:32,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2024-11-23 02:06:32,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-23 02:06:32,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 43 transitions. [2024-11-23 02:06:32,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-23 02:06:32,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-23 02:06:32,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2024-11-23 02:06:32,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:06:32,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-11-23 02:06:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2024-11-23 02:06:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-23 02:06:32,068 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-11-23 02:06:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2024-11-23 02:06:32,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-11-23 02:06:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:06:32,070 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-11-23 02:06:32,070 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:06:32,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2024-11-23 02:06:32,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-23 02:06:32,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:32,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:32,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:06:32,071 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-11-23 02:06:32,072 INFO L745 eck$LassoCheckResult]: Stem: 318#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 304#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; 305#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; 312#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; 308#L41-3 [2024-11-23 02:06:32,072 INFO L747 eck$LassoCheckResult]: Loop: 308#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 309#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 314#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; 291#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 292#$Ultimate##0 ~n := #in~n; 315#L25 assume ~n <= 0;#res := 1; 316#factFINAL assume true; 293#factEXIT >#78#return; 296#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 292#$Ultimate##0 ~n := #in~n; 315#L25 assume ~n <= 0;#res := 1; 316#factFINAL assume true; 293#factEXIT >#80#return; 298#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 292#$Ultimate##0 ~n := #in~n; 315#L25 assume !(~n <= 0); 294#L26 call #t~ret0 := fact(~n - 1);< 292#$Ultimate##0 ~n := #in~n; 315#L25 assume ~n <= 0;#res := 1; 316#factFINAL assume true; 293#factEXIT >#70#return; 300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 302#factFINAL assume true; 303#factEXIT >#82#return; 306#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; 307#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; 313#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 317#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 319#L42-4 havoc main_~k~0#1; 311#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 308#L41-3 [2024-11-23 02:06:32,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2024-11-23 02:06:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358652641] [2024-11-23 02:06:32,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:32,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:06:32,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:32,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:32,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 500720164, now seen corresponding path program 1 times [2024-11-23 02:06:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724897375] [2024-11-23 02:06:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792193201] [2024-11-23 02:06:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:32,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,095 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-11-23 02:06:32,096 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-11-23 02:06:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:32,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:32,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -533252661, now seen corresponding path program 1 times [2024-11-23 02:06:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:32,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386215241] [2024-11-23 02:06:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-23 02:06:32,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:32,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386215241] [2024-11-23 02:06:32,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386215241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:32,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:06:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:06:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491827452] [2024-11-23 02:06:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:32,436 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:32,436 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:32,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:32,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:32,437 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:32,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,437 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:32,437 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:32,437 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-11-23 02:06:32,437 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:32,437 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:32,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,510 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:32,510 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:32,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 02:06:32,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:32,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:32,524 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:32,525 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-11-23 02:06:32,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,539 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-23 02:06:32,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:32,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:32,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,554 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:32,554 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-11-23 02:06:32,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,561 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-23 02:06:32,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:32,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:32,573 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:32,574 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-11-23 02:06:32,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,581 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 02:06:32,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:32,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:32,594 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:32,595 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-11-23 02:06:32,600 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-11-23 02:06:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,602 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 02:06:32,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:32,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:32,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-23 02:06:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,623 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 02:06:32,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:32,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:32,644 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:32,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:06:32,649 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:32,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:32,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:32,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:32,649 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:32,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:32,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:32,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-11-23 02:06:32,649 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:32,649 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:32,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:32,717 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:32,718 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:32,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,720 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 02:06:32,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:32,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:32,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:32,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:32,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:32,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:32,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:32,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:32,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:32,739 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-11-23 02:06:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,742 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 02:06:32,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:32,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:32,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:32,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:32,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:32,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:32,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:32,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:32,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:32,762 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-11-23 02:06:32,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,764 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:06:32,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:32,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:32,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:32,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:32,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:32,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:32,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:32,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:32,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:32,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,787 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 02:06:32,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:32,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:32,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:32,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:32,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:32,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:32,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:32,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:32,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:32,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,809 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:06:32,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:32,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:32,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:32,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:32,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:32,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:32,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:32,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:32,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:32,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,833 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:06:32,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:32,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:32,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:32,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:32,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:32,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:32,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:32,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:32,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:32,853 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:32,853 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:06:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:32,855 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:32,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 02:06:32,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:32,858 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:32,858 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:32,858 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-11-23 02:06:32,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:32,865 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:32,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:32,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:06:32,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:32,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 02:06:32,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-23 02:06:33,006 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-23 02:06:33,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-11-23 02:06:33,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) Result 177 states and 264 transitions. Complement of second has 20 states. [2024-11-23 02:06:33,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-11-23 02:06:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-11-23 02:06:33,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 80 transitions. Stem has 4 letters. Loop has 30 letters. [2024-11-23 02:06:33,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:33,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 80 transitions. Stem has 34 letters. Loop has 30 letters. [2024-11-23 02:06:33,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:33,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 80 transitions. Stem has 4 letters. Loop has 60 letters. [2024-11-23 02:06:33,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:33,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 264 transitions. [2024-11-23 02:06:33,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2024-11-23 02:06:33,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 175 states and 262 transitions. [2024-11-23 02:06:33,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-11-23 02:06:33,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2024-11-23 02:06:33,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 262 transitions. [2024-11-23 02:06:33,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:33,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 262 transitions. [2024-11-23 02:06:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 262 transitions. [2024-11-23 02:06:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2024-11-23 02:06:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 101 states have internal predecessors, (113), 46 states have call successors, (46), 10 states have call predecessors, (46), 16 states have return successors, (70), 42 states have call predecessors, (70), 46 states have call successors, (70) [2024-11-23 02:06:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2024-11-23 02:06:33,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 229 transitions. [2024-11-23 02:06:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:33,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:06:33,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:06:33,279 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-11-23 02:06:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:33,319 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-11-23 02:06:33,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 126 transitions. [2024-11-23 02:06:33,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-23 02:06:33,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 47 states and 65 transitions. [2024-11-23 02:06:33,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-23 02:06:33,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-23 02:06:33,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2024-11-23 02:06:33,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:06:33,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-23 02:06:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2024-11-23 02:06:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-11-23 02:06:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-23 02:06:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-23 02:06:33,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-23 02:06:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:06:33,326 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-23 02:06:33,327 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:06:33,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 63 transitions. [2024-11-23 02:06:33,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2024-11-23 02:06:33,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:33,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:33,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:06:33,328 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-11-23 02:06:33,328 INFO L745 eck$LassoCheckResult]: Stem: 924#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 907#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; 908#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; 917#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; 912#L41-3 [2024-11-23 02:06:33,328 INFO L747 eck$LassoCheckResult]: Loop: 912#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 913#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 919#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; 899#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 891#$Ultimate##0 ~n := #in~n; 929#L25 assume ~n <= 0;#res := 1; 928#factFINAL assume true; 927#factEXIT >#72#return; 922#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 891#$Ultimate##0 ~n := #in~n; 929#L25 assume ~n <= 0;#res := 1; 928#factFINAL assume true; 927#factEXIT >#74#return; 890#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 891#$Ultimate##0 ~n := #in~n; 929#L25 assume ~n <= 0;#res := 1; 928#factFINAL assume true; 927#factEXIT >#76#return; 914#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; 915#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; 918#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 923#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 925#L42-4 havoc main_~k~0#1; 916#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 912#L41-3 [2024-11-23 02:06:33,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2024-11-23 02:06:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541563947] [2024-11-23 02:06:33,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:33,332 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:33,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:33,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:33,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:33,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -481826528, now seen corresponding path program 1 times [2024-11-23 02:06:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373107385] [2024-11-23 02:06:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:33,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931233427] [2024-11-23 02:06:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:33,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:33,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,344 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-23 02:06:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:33,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:33,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1147386361, now seen corresponding path program 1 times [2024-11-23 02:06:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330383044] [2024-11-23 02:06:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961728228] [2024-11-23 02:06:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:33,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,421 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-11-23 02:06:33,422 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-11-23 02:06:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:33,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:33,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:33,619 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:33,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:33,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:33,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:33,619 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:33,620 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,620 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:33,620 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:33,620 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration4_Loop [2024-11-23 02:06:33,620 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:33,620 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:33,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:33,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,708 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:33,709 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,711 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-23 02:06:33,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:33,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:33,724 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:33,724 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-11-23 02:06:33,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-23 02:06:33,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,733 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-23 02:06:33,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:33,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:33,748 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:33,748 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-11-23 02:06:33,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,756 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:33,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:33,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-23 02:06:33,772 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:33,773 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-11-23 02:06:33,778 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-11-23 02:06:33,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,780 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 02:06:33,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:33,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:33,793 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:33,794 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-11-23 02:06:33,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-23 02:06:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,800 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-23 02:06:33,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:33,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:33,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-23 02:06:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,820 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-23 02:06:33,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:33,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:33,856 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:33,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-23 02:06:33,860 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:33,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:33,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:33,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:33,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:33,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:33,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:33,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration4_Loop [2024-11-23 02:06:33,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:33,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:33,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:33,919 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:33,919 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,921 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:33,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-23 02:06:33,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:33,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:33,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:33,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:33,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:33,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:33,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:33,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:33,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:33,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:33,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,944 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-11-23 02:06:33,945 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-11-23 02:06:33,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:33,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:33,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:33,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:33,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:33,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:33,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:33,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:33,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:33,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:33,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,966 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-11-23 02:06:33,967 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-11-23 02:06:33,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:33,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:33,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:33,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:33,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:33,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:33,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:33,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:33,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:33,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:33,989 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-11-23 02:06:33,989 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-11-23 02:06:33,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:34,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:34,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:34,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:34,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:34,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:34,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:34,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:34,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:34,008 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-11-23 02:06:34,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:34,011 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-11-23 02:06:34,012 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-11-23 02:06:34,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:34,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:34,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:34,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:34,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:34,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:34,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:34,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:34,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:34,032 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-11-23 02:06:34,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:34,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:34,033 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-11-23 02:06:34,034 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-11-23 02:06:34,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:34,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:34,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:34,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:34,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:34,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:34,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:34,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:34,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:34,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:34,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:34,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:34,059 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-11-23 02:06:34,061 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-11-23 02:06:34,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:34,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:34,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:34,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:34,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:34,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:34,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:34,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:34,076 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:34,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:34,082 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:06:34,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:34,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:34,085 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:34,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-23 02:06:34,087 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:34,087 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:34,087 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:34,087 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-11-23 02:06:34,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:34,095 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:34,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:34,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:06:34,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:34,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:06:34,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-23 02:06:34,268 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-11-23 02:06:34,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 63 transitions. cyclomatic complexity: 20 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-11-23 02:06:34,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 63 transitions. cyclomatic complexity: 20. 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 163 states and 246 transitions. Complement of second has 28 states. [2024-11-23 02:06:34,482 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-11-23 02:06:34,483 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-11-23 02:06:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-11-23 02:06:34,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 24 letters. [2024-11-23 02:06:34,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:34,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 28 letters. Loop has 24 letters. [2024-11-23 02:06:34,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:34,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 48 letters. [2024-11-23 02:06:34,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:34,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 246 transitions. [2024-11-23 02:06:34,488 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2024-11-23 02:06:34,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 161 states and 244 transitions. [2024-11-23 02:06:34,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2024-11-23 02:06:34,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-23 02:06:34,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 244 transitions. [2024-11-23 02:06:34,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:34,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 244 transitions. [2024-11-23 02:06:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 244 transitions. [2024-11-23 02:06:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2024-11-23 02:06:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 99 states have internal predecessors, (111), 44 states have call successors, (44), 10 states have call predecessors, (44), 16 states have return successors, (70), 42 states have call predecessors, (70), 44 states have call successors, (70) [2024-11-23 02:06:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 225 transitions. [2024-11-23 02:06:34,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 225 transitions. [2024-11-23 02:06:34,511 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 225 transitions. [2024-11-23 02:06:34,511 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:06:34,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 225 transitions. [2024-11-23 02:06:34,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2024-11-23 02:06:34,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:34,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:34,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:06:34,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:34,513 INFO L745 eck$LassoCheckResult]: Stem: 1318#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1275#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; 1276#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; 1293#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; 1319#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1284#L42-3 [2024-11-23 02:06:34,513 INFO L747 eck$LassoCheckResult]: Loop: 1284#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1303#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; 1256#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1257#$Ultimate##0 ~n := #in~n; 1357#L25 assume !(~n <= 0); 1265#L26 call #t~ret0 := fact(~n - 1);< 1281#$Ultimate##0 ~n := #in~n; 1306#L25 assume ~n <= 0;#res := 1; 1260#factFINAL assume true; 1266#factEXIT >#70#return; 1353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1351#factFINAL assume true; 1350#factEXIT >#72#return; 1336#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1257#$Ultimate##0 ~n := #in~n; 1357#L25 assume !(~n <= 0); 1265#L26 call #t~ret0 := fact(~n - 1);< 1281#$Ultimate##0 ~n := #in~n; 1306#L25 assume ~n <= 0;#res := 1; 1260#factFINAL assume true; 1266#factEXIT >#70#return; 1353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1351#factFINAL assume true; 1350#factEXIT >#74#return; 1337#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1257#$Ultimate##0 ~n := #in~n; 1357#L25 assume !(~n <= 0); 1265#L26 call #t~ret0 := fact(~n - 1);< 1281#$Ultimate##0 ~n := #in~n; 1306#L25 assume ~n <= 0;#res := 1; 1260#factFINAL assume true; 1266#factEXIT >#70#return; 1353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1351#factFINAL assume true; 1350#factEXIT >#76#return; 1328#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; 1326#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; 1324#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1323#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1321#L42-4 havoc main_~k~0#1; 1290#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1283#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1284#L42-3 [2024-11-23 02:06:34,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2024-11-23 02:06:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842619151] [2024-11-23 02:06:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:34,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:34,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:34,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1997853698, now seen corresponding path program 1 times [2024-11-23 02:06:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436416651] [2024-11-23 02:06:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-23 02:06:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436416651] [2024-11-23 02:06:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436416651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:06:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:06:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048622258] [2024-11-23 02:06:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:34,641 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:06:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:06:34,642 INFO L87 Difference]: Start difference. First operand 152 states and 225 transitions. cyclomatic complexity: 78 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-11-23 02:06:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:34,710 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2024-11-23 02:06:34,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 294 transitions. [2024-11-23 02:06:34,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2024-11-23 02:06:34,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 188 states and 285 transitions. [2024-11-23 02:06:34,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-23 02:06:34,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-23 02:06:34,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 285 transitions. [2024-11-23 02:06:34,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:34,723 INFO L218 hiAutomatonCegarLoop]: Abstraction has 188 states and 285 transitions. [2024-11-23 02:06:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 285 transitions. [2024-11-23 02:06:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2024-11-23 02:06:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 105 states have internal predecessors, (117), 44 states have call successors, (44), 10 states have call predecessors, (44), 16 states have return successors, (70), 42 states have call predecessors, (70), 44 states have call successors, (70) [2024-11-23 02:06:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 231 transitions. [2024-11-23 02:06:34,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158 states and 231 transitions. [2024-11-23 02:06:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:06:34,735 INFO L425 stractBuchiCegarLoop]: Abstraction has 158 states and 231 transitions. [2024-11-23 02:06:34,735 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:06:34,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 231 transitions. [2024-11-23 02:06:34,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2024-11-23 02:06:34,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:34,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:34,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:06:34,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 6, 5, 5, 5, 5, 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-11-23 02:06:34,737 INFO L745 eck$LassoCheckResult]: Stem: 1678#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1635#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; 1636#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; 1658#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; 1679#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1648#L42-3 [2024-11-23 02:06:34,737 INFO L747 eck$LassoCheckResult]: Loop: 1648#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1661#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; 1622#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1597#$Ultimate##0 ~n := #in~n; 1723#L25 assume !(~n <= 0); 1603#L26 call #t~ret0 := fact(~n - 1);< 1641#$Ultimate##0 ~n := #in~n; 1708#L25 assume ~n <= 0;#res := 1; 1706#factFINAL assume true; 1600#factEXIT >#70#return; 1607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1721#factFINAL assume true; 1719#factEXIT >#72#return; 1673#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1597#$Ultimate##0 ~n := #in~n; 1723#L25 assume !(~n <= 0); 1603#L26 call #t~ret0 := fact(~n - 1);< 1641#$Ultimate##0 ~n := #in~n; 1708#L25 assume ~n <= 0;#res := 1; 1706#factFINAL assume true; 1600#factEXIT >#70#return; 1607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1721#factFINAL assume true; 1719#factEXIT >#74#return; 1596#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1597#$Ultimate##0 ~n := #in~n; 1723#L25 assume !(~n <= 0); 1603#L26 call #t~ret0 := fact(~n - 1);< 1641#$Ultimate##0 ~n := #in~n; 1708#L25 assume ~n <= 0;#res := 1; 1706#factFINAL assume true; 1600#factEXIT >#70#return; 1607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1721#factFINAL assume true; 1719#factEXIT >#76#return; 1691#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; 1709#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; 1707#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1705#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1684#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; 1697#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1700#$Ultimate##0 ~n := #in~n; 1704#L25 assume !(~n <= 0); 1604#L26 call #t~ret0 := fact(~n - 1);< 1641#$Ultimate##0 ~n := #in~n; 1708#L25 assume ~n <= 0;#res := 1; 1706#factFINAL assume true; 1600#factEXIT >#70#return; 1608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1701#factFINAL assume true; 1693#factEXIT >#78#return; 1696#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1700#$Ultimate##0 ~n := #in~n; 1704#L25 assume ~n <= 0;#res := 1; 1703#factFINAL assume true; 1702#factEXIT >#80#return; 1694#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1700#$Ultimate##0 ~n := #in~n; 1704#L25 assume !(~n <= 0); 1604#L26 call #t~ret0 := fact(~n - 1);< 1641#$Ultimate##0 ~n := #in~n; 1708#L25 assume ~n <= 0;#res := 1; 1706#factFINAL assume true; 1600#factEXIT >#70#return; 1608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1701#factFINAL assume true; 1693#factEXIT >#82#return; 1692#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; 1689#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; 1685#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1683#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1680#L42-4 havoc main_~k~0#1; 1651#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1647#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1648#L42-3 [2024-11-23 02:06:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2024-11-23 02:06:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901791558] [2024-11-23 02:06:34,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:34,740 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:06:34,740 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:34,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:34,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:34,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash 616908711, now seen corresponding path program 1 times [2024-11-23 02:06:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015930913] [2024-11-23 02:06:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:34,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-23 02:06:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-23 02:06:34,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015930913] [2024-11-23 02:06:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015930913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108930189] [2024-11-23 02:06:34,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:34,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:34,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:34,938 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-11-23 02:06:34,943 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-11-23 02:06:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:35,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 02:06:35,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 142 proven. 35 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-23 02:06:35,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-23 02:06:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108930189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:35,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 16 [2024-11-23 02:06:35,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30608333] [2024-11-23 02:06:35,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:35,329 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 02:06:35,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-23 02:06:35,330 INFO L87 Difference]: Start difference. First operand 158 states and 231 transitions. cyclomatic complexity: 78 Second operand has 16 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 9 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2024-11-23 02:06:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:35,713 INFO L93 Difference]: Finished difference Result 325 states and 514 transitions. [2024-11-23 02:06:35,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 514 transitions. [2024-11-23 02:06:35,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-11-23 02:06:35,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 321 states and 502 transitions. [2024-11-23 02:06:35,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2024-11-23 02:06:35,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2024-11-23 02:06:35,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 502 transitions. [2024-11-23 02:06:35,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:35,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321 states and 502 transitions. [2024-11-23 02:06:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 502 transitions. [2024-11-23 02:06:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 272. [2024-11-23 02:06:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 174 states have (on average 1.1551724137931034) internal successors, (201), 171 states have internal predecessors, (201), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (148), 72 states have call predecessors, (148), 70 states have call successors, (148) [2024-11-23 02:06:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2024-11-23 02:06:35,755 INFO L240 hiAutomatonCegarLoop]: Abstraction has 272 states and 419 transitions. [2024-11-23 02:06:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 02:06:35,760 INFO L425 stractBuchiCegarLoop]: Abstraction has 272 states and 419 transitions. [2024-11-23 02:06:35,760 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:06:35,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 272 states and 419 transitions. [2024-11-23 02:06:35,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2024-11-23 02:06:35,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:35,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:35,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:06:35,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 6, 5, 5, 5, 5, 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-11-23 02:06:35,763 INFO L745 eck$LassoCheckResult]: Stem: 2638#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2585#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; 2586#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; 2605#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; 2639#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2596#L42-3 [2024-11-23 02:06:35,763 INFO L747 eck$LassoCheckResult]: Loop: 2596#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2625#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; 2577#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2578#$Ultimate##0 ~n := #in~n; 2780#L25 assume !(~n <= 0); 2681#L26 call #t~ret0 := fact(~n - 1);< 2699#$Ultimate##0 ~n := #in~n; 2727#L25 assume ~n <= 0;#res := 1; 2690#factFINAL assume true; 2677#factEXIT >#70#return; 2686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2738#factFINAL assume true; 2740#factEXIT >#72#return; 2739#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2778#$Ultimate##0 ~n := #in~n; 2779#L25 assume ~n <= 0;#res := 1; 2775#factFINAL assume true; 2773#factEXIT >#74#return; 2725#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2578#$Ultimate##0 ~n := #in~n; 2780#L25 assume ~n <= 0;#res := 1; 2775#factFINAL assume true; 2773#factEXIT >#76#return; 2692#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; 2674#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; 2671#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2670#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2645#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; 2660#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2664#$Ultimate##0 ~n := #in~n; 2714#L25 assume !(~n <= 0); 2685#L26 call #t~ret0 := fact(~n - 1);< 2699#$Ultimate##0 ~n := #in~n; 2727#L25 assume !(~n <= 0); 2679#L26 call #t~ret0 := fact(~n - 1);< 2699#$Ultimate##0 ~n := #in~n; 2727#L25 assume ~n <= 0;#res := 1; 2690#factFINAL assume true; 2677#factEXIT >#70#return; 2687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2704#factFINAL assume true; 2695#factEXIT >#70#return; 2694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2666#factFINAL assume true; 2667#factEXIT >#78#return; 2657#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2664#$Ultimate##0 ~n := #in~n; 2714#L25 assume ~n <= 0;#res := 1; 2701#factFINAL assume true; 2691#factEXIT >#80#return; 2654#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2664#$Ultimate##0 ~n := #in~n; 2714#L25 assume !(~n <= 0); 2685#L26 call #t~ret0 := fact(~n - 1);< 2699#$Ultimate##0 ~n := #in~n; 2727#L25 assume !(~n <= 0); 2679#L26 call #t~ret0 := fact(~n - 1);< 2699#$Ultimate##0 ~n := #in~n; 2727#L25 assume ~n <= 0;#res := 1; 2690#factFINAL assume true; 2677#factEXIT >#70#return; 2687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2704#factFINAL assume true; 2695#factEXIT >#70#return; 2694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2666#factFINAL assume true; 2667#factEXIT >#82#return; 2649#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; 2647#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; 2646#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2644#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2642#L42-4 havoc main_~k~0#1; 2603#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2595#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2596#L42-3 [2024-11-23 02:06:35,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:35,764 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2024-11-23 02:06:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:35,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152774972] [2024-11-23 02:06:35,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:35,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:35,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:06:35,767 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:35,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:35,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:35,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1004069657, now seen corresponding path program 2 times [2024-11-23 02:06:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485884352] [2024-11-23 02:06:35,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:35,787 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:35,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 11 proven. 78 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-23 02:06:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485884352] [2024-11-23 02:06:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485884352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893556310] [2024-11-23 02:06:35,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:35,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:35,961 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-11-23 02:06:35,962 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-11-23 02:06:36,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:36,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:36,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 02:06:36,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 131 proven. 7 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-23 02:06:36,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 11 proven. 78 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-23 02:06:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893556310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:36,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2024-11-23 02:06:36,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043245400] [2024-11-23 02:06:36,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:36,230 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:36,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:36,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 02:06:36,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-23 02:06:36,231 INFO L87 Difference]: Start difference. First operand 272 states and 419 transitions. cyclomatic complexity: 152 Second operand has 16 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 10 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-23 02:06:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:36,444 INFO L93 Difference]: Finished difference Result 332 states and 517 transitions. [2024-11-23 02:06:36,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 517 transitions. [2024-11-23 02:06:36,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 81 [2024-11-23 02:06:36,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 517 transitions. [2024-11-23 02:06:36,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2024-11-23 02:06:36,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2024-11-23 02:06:36,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 517 transitions. [2024-11-23 02:06:36,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:36,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 517 transitions. [2024-11-23 02:06:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 517 transitions. [2024-11-23 02:06:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 292. [2024-11-23 02:06:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 186 states have (on average 1.1451612903225807) internal successors, (213), 177 states have internal predecessors, (213), 78 states have call successors, (78), 34 states have call predecessors, (78), 28 states have return successors, (164), 80 states have call predecessors, (164), 78 states have call successors, (164) [2024-11-23 02:06:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 455 transitions. [2024-11-23 02:06:36,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 292 states and 455 transitions. [2024-11-23 02:06:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 02:06:36,479 INFO L425 stractBuchiCegarLoop]: Abstraction has 292 states and 455 transitions. [2024-11-23 02:06:36,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:06:36,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 455 transitions. [2024-11-23 02:06:36,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2024-11-23 02:06:36,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:36,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:36,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:06:36,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 8, 8, 8, 8, 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-11-23 02:06:36,483 INFO L745 eck$LassoCheckResult]: Stem: 3699#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3644#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; 3645#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; 3666#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; 3700#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3659#L42-3 [2024-11-23 02:06:36,483 INFO L747 eck$LassoCheckResult]: Loop: 3659#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3782#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; 3767#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3780#$Ultimate##0 ~n := #in~n; 3800#L25 assume !(~n <= 0); 3739#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume ~n <= 0;#res := 1; 3750#factFINAL assume true; 3736#factEXIT >#70#return; 3747#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3795#factFINAL assume true; 3794#factEXIT >#72#return; 3766#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3781#$Ultimate##0 ~n := #in~n; 3799#L25 assume !(~n <= 0); 3740#L26 call #t~ret0 := fact(~n - 1);< 3653#$Ultimate##0 ~n := #in~n; 3753#L25 assume ~n <= 0;#res := 1; 3750#factFINAL assume true; 3736#factEXIT >#70#return; 3747#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3795#factFINAL assume true; 3794#factEXIT >#74#return; 3768#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3774#$Ultimate##0 ~n := #in~n; 3783#L25 assume ~n <= 0;#res := 1; 3779#factFINAL assume true; 3765#factEXIT >#76#return; 3761#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; 3752#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; 3749#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3704#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; 3714#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3729#$Ultimate##0 ~n := #in~n; 3778#L25 assume !(~n <= 0); 3741#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume !(~n <= 0); 3737#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume ~n <= 0;#res := 1; 3750#factFINAL assume true; 3736#factEXIT >#70#return; 3745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3762#factFINAL assume true; 3754#factEXIT >#70#return; 3748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3727#factFINAL assume true; 3728#factEXIT >#78#return; 3718#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3729#$Ultimate##0 ~n := #in~n; 3778#L25 assume !(~n <= 0); 3741#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume !(~n <= 0); 3737#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume ~n <= 0;#res := 1; 3750#factFINAL assume true; 3736#factEXIT >#70#return; 3745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3762#factFINAL assume true; 3754#factEXIT >#70#return; 3748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3727#factFINAL assume true; 3728#factEXIT >#80#return; 3721#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3725#$Ultimate##0 ~n := #in~n; 3760#L25 assume !(~n <= 0); 3741#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume !(~n <= 0); 3737#L26 call #t~ret0 := fact(~n - 1);< 3757#$Ultimate##0 ~n := #in~n; 3776#L25 assume ~n <= 0;#res := 1; 3750#factFINAL assume true; 3736#factEXIT >#70#return; 3745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3762#factFINAL assume true; 3754#factEXIT >#70#return; 3748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3727#factFINAL assume true; 3728#factEXIT >#82#return; 3709#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; 3706#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; 3705#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3703#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 3701#L42-4 havoc main_~k~0#1; 3664#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3658#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3659#L42-3 [2024-11-23 02:06:36,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2024-11-23 02:06:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849883911] [2024-11-23 02:06:36,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:36,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:36,486 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:36,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:36,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:36,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:36,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1995727769, now seen corresponding path program 3 times [2024-11-23 02:06:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107822887] [2024-11-23 02:06:36,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:36,518 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-23 02:06:36,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 102 proven. 3 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-23 02:06:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:36,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107822887] [2024-11-23 02:06:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107822887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:36,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262771369] [2024-11-23 02:06:36,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:36,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:36,621 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-11-23 02:06:36,622 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-11-23 02:06:36,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-23 02:06:36,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:36,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 02:06:36,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 102 proven. 3 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-23 02:06:36,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 102 proven. 4 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-23 02:06:36,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262771369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:36,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2024-11-23 02:06:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83304413] [2024-11-23 02:06:36,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:36,908 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 02:06:36,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-23 02:06:36,908 INFO L87 Difference]: Start difference. First operand 292 states and 455 transitions. cyclomatic complexity: 168 Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-23 02:06:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:37,022 INFO L93 Difference]: Finished difference Result 332 states and 539 transitions. [2024-11-23 02:06:37,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 539 transitions. [2024-11-23 02:06:37,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-11-23 02:06:37,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 539 transitions. [2024-11-23 02:06:37,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2024-11-23 02:06:37,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2024-11-23 02:06:37,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 539 transitions. [2024-11-23 02:06:37,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:37,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 539 transitions. [2024-11-23 02:06:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 539 transitions. [2024-11-23 02:06:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 314. [2024-11-23 02:06:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 192 states have (on average 1.1614583333333333) internal successors, (223), 187 states have internal predecessors, (223), 94 states have call successors, (94), 34 states have call predecessors, (94), 28 states have return successors, (196), 92 states have call predecessors, (196), 94 states have call successors, (196) [2024-11-23 02:06:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 513 transitions. [2024-11-23 02:06:37,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 513 transitions. [2024-11-23 02:06:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:06:37,042 INFO L425 stractBuchiCegarLoop]: Abstraction has 314 states and 513 transitions. [2024-11-23 02:06:37,042 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:06:37,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 513 transitions. [2024-11-23 02:06:37,044 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2024-11-23 02:06:37,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:37,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:37,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:06:37,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 7, 7, 7, 7, 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-11-23 02:06:37,045 INFO L745 eck$LassoCheckResult]: Stem: 4897#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4845#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; 4846#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; 4864#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; 4898#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4854#L42-3 [2024-11-23 02:06:37,045 INFO L747 eck$LassoCheckResult]: Loop: 4854#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4867#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; 4842#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4843#$Ultimate##0 ~n := #in~n; 5016#L25 assume !(~n <= 0); 4829#L26 call #t~ret0 := fact(~n - 1);< 4851#$Ultimate##0 ~n := #in~n; 4971#L25 assume ~n <= 0;#res := 1; 4968#factFINAL assume true; 4956#factEXIT >#70#return; 4961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5019#factFINAL assume true; 4992#factEXIT >#72#return; 4993#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5002#$Ultimate##0 ~n := #in~n; 5023#L25 assume !(~n <= 0); 4958#L26 call #t~ret0 := fact(~n - 1);< 4964#$Ultimate##0 ~n := #in~n; 4969#L25 assume ~n <= 0;#res := 1; 4968#factFINAL assume true; 4956#factEXIT >#70#return; 4961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5019#factFINAL assume true; 4992#factEXIT >#74#return; 4824#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4825#$Ultimate##0 ~n := #in~n; 4878#L25 assume ~n <= 0;#res := 1; 4879#factFINAL assume true; 5001#factEXIT >#76#return; 4950#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; 4999#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; 4998#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4874#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4875#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; 4916#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4945#$Ultimate##0 ~n := #in~n; 4965#L25 assume !(~n <= 0); 4832#L26 call #t~ret0 := fact(~n - 1);< 4851#$Ultimate##0 ~n := #in~n; 4971#L25 assume !(~n <= 0); 4831#L26 call #t~ret0 := fact(~n - 1);< 4851#$Ultimate##0 ~n := #in~n; 4971#L25 assume ~n <= 0;#res := 1; 4968#factFINAL assume true; 4956#factEXIT >#70#return; 4869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4828#factFINAL assume true; 4834#factEXIT >#70#return; 4972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4943#factFINAL assume true; 4944#factEXIT >#78#return; 4922#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4945#$Ultimate##0 ~n := #in~n; 4965#L25 assume !(~n <= 0); 4832#L26 call #t~ret0 := fact(~n - 1);< 4851#$Ultimate##0 ~n := #in~n; 4971#L25 assume !(~n <= 0); 4831#L26 call #t~ret0 := fact(~n - 1);< 4851#$Ultimate##0 ~n := #in~n; 4971#L25 assume ~n <= 0;#res := 1; 4968#factFINAL assume true; 4956#factEXIT >#70#return; 4869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4828#factFINAL assume true; 4834#factEXIT >#70#return; 4972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4943#factFINAL assume true; 4944#factEXIT >#80#return; 4926#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4929#$Ultimate##0 ~n := #in~n; 4966#L25 assume !(~n <= 0); 4832#L26 call #t~ret0 := fact(~n - 1);< 4851#$Ultimate##0 ~n := #in~n; 4971#L25 assume ~n <= 0;#res := 1; 4968#factFINAL assume true; 4956#factEXIT >#70#return; 4955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4954#factFINAL assume true; 4913#factEXIT >#82#return; 4912#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; 4908#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; 4907#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4905#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4902#L42-4 havoc main_~k~0#1; 4861#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4853#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4854#L42-3 [2024-11-23 02:06:37,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2024-11-23 02:06:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588574089] [2024-11-23 02:06:37,045 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:37,047 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:06:37,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:37,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:37,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:37,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash 881045351, now seen corresponding path program 4 times [2024-11-23 02:06:37,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:37,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536151242] [2024-11-23 02:06:37,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:37,057 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:37,058 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 61 proven. 98 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-23 02:06:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:37,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536151242] [2024-11-23 02:06:37,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536151242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:37,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736744272] [2024-11-23 02:06:37,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:37,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:37,266 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:37,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-23 02:06:37,315 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:37,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:37,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:06:37,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 160 proven. 69 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-23 02:06:37,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 60 proven. 101 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-23 02:06:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736744272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:37,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 13] total 21 [2024-11-23 02:06:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110306395] [2024-11-23 02:06:37,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:37,698 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:37,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-23 02:06:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-23 02:06:37,699 INFO L87 Difference]: Start difference. First operand 314 states and 513 transitions. cyclomatic complexity: 204 Second operand has 21 states, 16 states have (on average 3.25) internal successors, (52), 19 states have internal predecessors, (52), 14 states have call successors, (19), 2 states have call predecessors, (19), 6 states have return successors, (20), 10 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-23 02:06:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:38,079 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2024-11-23 02:06:38,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 799 transitions. [2024-11-23 02:06:38,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-23 02:06:38,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 474 states and 799 transitions. [2024-11-23 02:06:38,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-11-23 02:06:38,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-11-23 02:06:38,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 474 states and 799 transitions. [2024-11-23 02:06:38,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:38,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 474 states and 799 transitions. [2024-11-23 02:06:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states and 799 transitions. [2024-11-23 02:06:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 378. [2024-11-23 02:06:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 226 states have (on average 1.163716814159292) internal successors, (263), 223 states have internal predecessors, (263), 124 states have call successors, (124), 34 states have call predecessors, (124), 28 states have return successors, (246), 120 states have call predecessors, (246), 124 states have call successors, (246) [2024-11-23 02:06:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 633 transitions. [2024-11-23 02:06:38,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 378 states and 633 transitions. [2024-11-23 02:06:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 02:06:38,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 633 transitions. [2024-11-23 02:06:38,102 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:06:38,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 633 transitions. [2024-11-23 02:06:38,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 100 [2024-11-23 02:06:38,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:38,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:38,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:38,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 6, 6, 6, 6, 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-11-23 02:06:38,105 INFO L745 eck$LassoCheckResult]: Stem: 6287#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6230#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; 6231#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; 6250#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; 6239#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6240#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6255#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; 6222#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6223#$Ultimate##0 ~n := #in~n; 6531#L25 assume !(~n <= 0); 6234#L26 call #t~ret0 := fact(~n - 1);< 6235#$Ultimate##0 ~n := #in~n; 6345#L25 assume ~n <= 0;#res := 1; 6344#factFINAL assume true; 6337#factEXIT >#70#return; 6343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6409#factFINAL assume true; 6390#factEXIT >#72#return; 6236#L30-1 [2024-11-23 02:06:38,105 INFO L747 eck$LassoCheckResult]: Loop: 6236#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6223#$Ultimate##0 ~n := #in~n; 6531#L25 assume !(~n <= 0); 6234#L26 call #t~ret0 := fact(~n - 1);< 6235#$Ultimate##0 ~n := #in~n; 6345#L25 assume ~n <= 0;#res := 1; 6344#factFINAL assume true; 6337#factEXIT >#70#return; 6343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6409#factFINAL assume true; 6390#factEXIT >#74#return; 6278#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6277#$Ultimate##0 ~n := #in~n; 6279#L25 assume ~n <= 0;#res := 1; 6382#factFINAL assume true; 6375#factEXIT >#76#return; 6361#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; 6265#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; 6266#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6286#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6437#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; 6158#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6159#$Ultimate##0 ~n := #in~n; 6402#L25 assume !(~n <= 0); 6327#L26 call #t~ret0 := fact(~n - 1);< 6334#$Ultimate##0 ~n := #in~n; 6412#L25 assume !(~n <= 0); 6330#L26 call #t~ret0 := fact(~n - 1);< 6334#$Ultimate##0 ~n := #in~n; 6412#L25 assume ~n <= 0;#res := 1; 6344#factFINAL assume true; 6337#factEXIT >#70#return; 6333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6411#factFINAL assume true; 6326#factEXIT >#70#return; 6331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6399#factFINAL assume true; 6383#factEXIT >#78#return; 6177#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6284#$Ultimate##0 ~n := #in~n; 6534#L25 assume !(~n <= 0); 6339#L26 call #t~ret0 := fact(~n - 1);< 6235#$Ultimate##0 ~n := #in~n; 6345#L25 assume ~n <= 0;#res := 1; 6344#factFINAL assume true; 6337#factEXIT >#70#return; 6341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6415#factFINAL assume true; 6162#factEXIT >#80#return; 6174#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6220#$Ultimate##0 ~n := #in~n; 6403#L25 assume !(~n <= 0); 6327#L26 call #t~ret0 := fact(~n - 1);< 6334#$Ultimate##0 ~n := #in~n; 6412#L25 assume ~n <= 0;#res := 1; 6344#factFINAL assume true; 6337#factEXIT >#70#return; 6341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6415#factFINAL assume true; 6162#factEXIT >#82#return; 6188#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; 6295#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; 6293#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6294#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 6288#L42-4 havoc main_~k~0#1; 6246#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6247#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6388#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6385#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; 6379#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6380#$Ultimate##0 ~n := #in~n; 6407#L25 assume !(~n <= 0); 6274#L26 call #t~ret0 := fact(~n - 1);< 6334#$Ultimate##0 ~n := #in~n; 6412#L25 assume ~n <= 0;#res := 1; 6344#factFINAL assume true; 6337#factEXIT >#70#return; 6343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6409#factFINAL assume true; 6390#factEXIT >#72#return; 6236#L30-1 [2024-11-23 02:06:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1646072980, now seen corresponding path program 1 times [2024-11-23 02:06:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:38,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810074075] [2024-11-23 02:06:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:06:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810074075] [2024-11-23 02:06:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810074075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337853723] [2024-11-23 02:06:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:38,136 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:38,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-23 02:06:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:38,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:06:38,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:06:38,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:06:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337853723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:38,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-23 02:06:38,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119958050] [2024-11-23 02:06:38,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:38,220 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:06:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1932195429, now seen corresponding path program 5 times [2024-11-23 02:06:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983595436] [2024-11-23 02:06:38,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:38,239 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-23 02:06:38,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 93 proven. 19 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-23 02:06:38,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983595436] [2024-11-23 02:06:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983595436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105712452] [2024-11-23 02:06:38,389 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:38,392 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:38,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-23 02:06:38,455 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-23 02:06:38,455 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:38,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 02:06:38,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 93 proven. 19 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-23 02:06:38,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 93 proven. 20 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-23 02:06:38,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105712452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:38,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:38,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 17 [2024-11-23 02:06:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580058422] [2024-11-23 02:06:38,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:38,742 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:06:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:06:38,743 INFO L87 Difference]: Start difference. First operand 378 states and 633 transitions. cyclomatic complexity: 260 Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 02:06:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:38,820 INFO L93 Difference]: Finished difference Result 440 states and 754 transitions. [2024-11-23 02:06:38,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 754 transitions. [2024-11-23 02:06:38,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 127 [2024-11-23 02:06:38,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 440 states and 754 transitions. [2024-11-23 02:06:38,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-11-23 02:06:38,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-11-23 02:06:38,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 440 states and 754 transitions. [2024-11-23 02:06:38,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:38,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 440 states and 754 transitions. [2024-11-23 02:06:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states and 754 transitions. [2024-11-23 02:06:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-11-23 02:06:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 256 states have (on average 1.1640625) internal successors, (298), 253 states have internal predecessors, (298), 154 states have call successors, (154), 34 states have call predecessors, (154), 28 states have return successors, (300), 150 states have call predecessors, (300), 154 states have call successors, (300) [2024-11-23 02:06:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 752 transitions. [2024-11-23 02:06:38,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 438 states and 752 transitions. [2024-11-23 02:06:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 02:06:38,842 INFO L425 stractBuchiCegarLoop]: Abstraction has 438 states and 752 transitions. [2024-11-23 02:06:38,842 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:06:38,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 438 states and 752 transitions. [2024-11-23 02:06:38,844 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 127 [2024-11-23 02:06:38,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:38,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:38,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:38,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:06:38,845 INFO L745 eck$LassoCheckResult]: Stem: 7677#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 7629#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; 7630#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; 7650#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; 7639#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7640#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7655#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; 7656#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7790#$Ultimate##0 ~n := #in~n; 7833#L25 assume ~n <= 0;#res := 1; 7827#factFINAL assume true; 7822#factEXIT >#72#return; 7771#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7789#$Ultimate##0 ~n := #in~n; 7787#L25 assume ~n <= 0;#res := 1; 7788#factFINAL assume true; 7901#factEXIT >#74#return; 7591#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7599#$Ultimate##0 ~n := #in~n; 7675#L25 assume !(~n <= 0); 7635#L26 call #t~ret0 := fact(~n - 1);< 7636#$Ultimate##0 [2024-11-23 02:06:38,845 INFO L747 eck$LassoCheckResult]: Loop: 7636#$Ultimate##0 ~n := #in~n; 7769#L25 assume !(~n <= 0); 7756#L26 call #t~ret0 := fact(~n - 1);< 7636#$Ultimate##0 [2024-11-23 02:06:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 342068977, now seen corresponding path program 1 times [2024-11-23 02:06:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525793642] [2024-11-23 02:06:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:06:38,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:38,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525793642] [2024-11-23 02:06:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525793642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:38,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:06:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 02:06:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142070491] [2024-11-23 02:06:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:38,880 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:06:38,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2024-11-23 02:06:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:38,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382158629] [2024-11-23 02:06:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:38,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:38,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:38,904 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:38,904 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:38,904 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:38,904 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:38,904 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:38,904 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:38,904 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:38,904 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:38,904 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2024-11-23 02:06:38,904 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:38,904 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:38,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:38,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:38,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:38,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:38,926 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:38,927 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:38,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:38,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:38,929 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-11-23 02:06:38,930 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-11-23 02:06:38,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:38,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:38,942 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:38,942 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-11-23 02:06:38,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:38,950 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-11-23 02:06:38,951 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-11-23 02:06:38,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:38,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:38,964 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:38,964 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:38,970 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-11-23 02:06:38,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:38,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:38,973 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-11-23 02:06:38,974 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-11-23 02:06:38,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:38,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:38,987 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:38,987 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:38,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:38,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:38,997 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-11-23 02:06:38,998 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-11-23 02:06:38,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:38,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:39,015 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-11-23 02:06:39,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,017 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-11-23 02:06:39,017 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-11-23 02:06:39,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:39,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:39,040 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:39,046 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-11-23 02:06:39,047 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:39,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:39,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:39,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:39,047 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:39,047 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,047 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:39,047 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:39,047 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2024-11-23 02:06:39,047 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:39,047 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:39,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,071 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:39,071 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:39,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,072 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-11-23 02:06:39,073 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-11-23 02:06:39,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:39,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:39,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:39,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:39,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:39,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:39,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:39,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:39,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:39,090 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-11-23 02:06:39,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,091 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-11-23 02:06:39,092 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-11-23 02:06:39,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:39,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:39,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:39,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:39,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:39,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:39,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:39,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:39,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:39,109 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-11-23 02:06:39,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,110 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-11-23 02:06:39,111 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-11-23 02:06:39,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:39,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:39,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:39,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:39,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:39,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:39,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:39,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:39,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:39,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,130 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-11-23 02:06:39,130 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-11-23 02:06:39,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:39,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:39,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:39,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:39,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:39,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:39,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:39,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:39,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:39,146 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:39,146 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:06:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,147 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-11-23 02:06:39,148 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-11-23 02:06:39,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:39,148 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:39,148 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:39,148 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-11-23 02:06:39,154 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-11-23 02:06:39,154 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:39,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:06:39,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:39,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:06:39,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:06:39,271 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-11-23 02:06:39,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 438 states and 752 transitions. cyclomatic complexity: 321 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 02:06:39,342 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 438 states and 752 transitions. cyclomatic complexity: 321. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 548 states and 914 transitions. Complement of second has 17 states. [2024-11-23 02:06:39,346 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-11-23 02:06:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 02:06:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-23 02:06:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 21 letters. Loop has 3 letters. [2024-11-23 02:06:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 24 letters. Loop has 3 letters. [2024-11-23 02:06:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 21 letters. Loop has 6 letters. [2024-11-23 02:06:39,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:39,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 914 transitions. [2024-11-23 02:06:39,354 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 135 [2024-11-23 02:06:39,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 532 states and 892 transitions. [2024-11-23 02:06:39,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2024-11-23 02:06:39,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2024-11-23 02:06:39,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 892 transitions. [2024-11-23 02:06:39,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:39,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 532 states and 892 transitions. [2024-11-23 02:06:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 892 transitions. [2024-11-23 02:06:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2024-11-23 02:06:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 312 states have (on average 1.1794871794871795) internal successors, (368), 313 states have internal predecessors, (368), 176 states have call successors, (176), 52 states have call predecessors, (176), 38 states have return successors, (338), 160 states have call predecessors, (338), 176 states have call successors, (338) [2024-11-23 02:06:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 882 transitions. [2024-11-23 02:06:39,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 526 states and 882 transitions. [2024-11-23 02:06:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:06:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:06:39,376 INFO L87 Difference]: Start difference. First operand 526 states and 882 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 02:06:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:39,475 INFO L93 Difference]: Finished difference Result 628 states and 1000 transitions. [2024-11-23 02:06:39,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 1000 transitions. [2024-11-23 02:06:39,480 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 157 [2024-11-23 02:06:39,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 614 states and 984 transitions. [2024-11-23 02:06:39,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2024-11-23 02:06:39,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2024-11-23 02:06:39,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 614 states and 984 transitions. [2024-11-23 02:06:39,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:39,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 614 states and 984 transitions. [2024-11-23 02:06:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states and 984 transitions. [2024-11-23 02:06:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 588. [2024-11-23 02:06:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 352 states have (on average 1.1704545454545454) internal successors, (412), 355 states have internal predecessors, (412), 190 states have call successors, (190), 58 states have call predecessors, (190), 46 states have return successors, (350), 174 states have call predecessors, (350), 190 states have call successors, (350) [2024-11-23 02:06:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 952 transitions. [2024-11-23 02:06:39,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 588 states and 952 transitions. [2024-11-23 02:06:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 02:06:39,500 INFO L425 stractBuchiCegarLoop]: Abstraction has 588 states and 952 transitions. [2024-11-23 02:06:39,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-23 02:06:39,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 588 states and 952 transitions. [2024-11-23 02:06:39,503 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2024-11-23 02:06:39,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:39,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:39,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:39,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:39,504 INFO L745 eck$LassoCheckResult]: Stem: 9928#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9868#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; 9869#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; 9891#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; 9879#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9880#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10164#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; 9862#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9863#$Ultimate##0 ~n := #in~n; 9909#L25 assume ~n <= 0;#res := 1; 9910#factFINAL assume true; 10182#factEXIT >#72#return; 9853#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9913#$Ultimate##0 ~n := #in~n; 10181#L25 assume ~n <= 0;#res := 1; 9866#factFINAL assume true; 9852#factEXIT >#74#return; 9854#L30-2 [2024-11-23 02:06:39,505 INFO L747 eck$LassoCheckResult]: Loop: 9854#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10081#$Ultimate##0 ~n := #in~n; 10106#L25 assume ~n <= 0;#res := 1; 10088#factFINAL assume true; 10080#factEXIT >#76#return; 10079#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; 10077#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; 10075#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10074#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10072#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; 9968#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9925#$Ultimate##0 ~n := #in~n; 10066#L25 assume ~n <= 0;#res := 1; 10067#factFINAL assume true; 10073#factEXIT >#72#return; 9976#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9925#$Ultimate##0 ~n := #in~n; 10066#L25 assume ~n <= 0;#res := 1; 10067#factFINAL assume true; 10073#factEXIT >#74#return; 9854#L30-2 [2024-11-23 02:06:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -971449381, now seen corresponding path program 1 times [2024-11-23 02:06:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:39,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981321184] [2024-11-23 02:06:39,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:39,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:39,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:39,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:39,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash 430618666, now seen corresponding path program 1 times [2024-11-23 02:06:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920919226] [2024-11-23 02:06:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942501924] [2024-11-23 02:06:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:39,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:39,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,521 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:39,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-11-23 02:06:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:39,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:39,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:39,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2013864708, now seen corresponding path program 1 times [2024-11-23 02:06:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122242873] [2024-11-23 02:06:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:39,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-23 02:06:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122242873] [2024-11-23 02:06:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122242873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:06:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:06:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692873574] [2024-11-23 02:06:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:39,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-23 02:06:39,798 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:39,798 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:39,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:39,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:39,798 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:39,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:39,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:39,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-11-23 02:06:39,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:39,799 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:39,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:39,861 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:39,861 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:39,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,865 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-11-23 02:06:39,866 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-11-23 02:06:39,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:39,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:39,877 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:39,877 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-11-23 02:06:39,883 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-11-23 02:06:39,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,884 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-11-23 02:06:39,885 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-11-23 02:06:39,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:39,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:39,897 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:39,897 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-11-23 02:06:39,902 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-11-23 02:06:39,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,904 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-11-23 02:06:39,904 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-11-23 02:06:39,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:39,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:39,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:39,923 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-11-23 02:06:39,924 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-11-23 02:06:39,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:39,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:40,241 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:40,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:40,250 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:40,250 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:40,250 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:40,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:40,251 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:40,251 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:40,251 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:40,251 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:40,251 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-11-23 02:06:40,251 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:40,251 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:40,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:40,307 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:40,307 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:40,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:40,309 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-11-23 02:06:40,309 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-11-23 02:06:40,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:40,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:40,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:40,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:40,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:40,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:40,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:40,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:40,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:40,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:40,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:40,329 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-11-23 02:06:40,330 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-11-23 02:06:40,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:40,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:40,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:40,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:40,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:40,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:40,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:40,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:40,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:40,348 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-11-23 02:06:40,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:40,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:40,350 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:40,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-23 02:06:40,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:40,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:40,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:40,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:40,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:40,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:40,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:40,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:40,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:40,373 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-23 02:06:40,373 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-23 02:06:40,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:40,375 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-11-23 02:06:40,376 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-11-23 02:06:40,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:40,377 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:40,377 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:40,377 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2024-11-23 02:06:40,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:40,384 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:40,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:40,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:06:40,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:40,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-23 02:06:40,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-23 02:06:40,570 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-23 02:06:40,570 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 952 transitions. cyclomatic complexity: 376 Second operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-23 02:06:40,731 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 952 transitions. cyclomatic complexity: 376. Second operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Result 972 states and 1448 transitions. Complement of second has 35 states. [2024-11-23 02:06:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-23 02:06:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2024-11-23 02:06:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 17 letters. Loop has 20 letters. [2024-11-23 02:06:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:40,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 37 letters. Loop has 20 letters. [2024-11-23 02:06:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:40,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 17 letters. Loop has 40 letters. [2024-11-23 02:06:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:40,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 972 states and 1448 transitions. [2024-11-23 02:06:40,746 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 137 [2024-11-23 02:06:40,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 972 states to 956 states and 1414 transitions. [2024-11-23 02:06:40,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2024-11-23 02:06:40,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2024-11-23 02:06:40,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1414 transitions. [2024-11-23 02:06:40,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:40,753 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1414 transitions. [2024-11-23 02:06:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1414 transitions. [2024-11-23 02:06:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 944. [2024-11-23 02:06:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 580 states have (on average 1.1413793103448275) internal successors, (662), 591 states have internal predecessors, (662), 258 states have call successors, (272), 114 states have call predecessors, (272), 106 states have return successors, (468), 238 states have call predecessors, (468), 258 states have call successors, (468) [2024-11-23 02:06:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1402 transitions. [2024-11-23 02:06:40,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1402 transitions. [2024-11-23 02:06:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:40,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:06:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:06:40,771 INFO L87 Difference]: Start difference. First operand 944 states and 1402 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-23 02:06:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:40,829 INFO L93 Difference]: Finished difference Result 828 states and 1216 transitions. [2024-11-23 02:06:40,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 828 states and 1216 transitions. [2024-11-23 02:06:40,834 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2024-11-23 02:06:40,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 828 states to 804 states and 1180 transitions. [2024-11-23 02:06:40,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2024-11-23 02:06:40,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2024-11-23 02:06:40,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 804 states and 1180 transitions. [2024-11-23 02:06:40,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:40,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 804 states and 1180 transitions. [2024-11-23 02:06:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states and 1180 transitions. [2024-11-23 02:06:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 802. [2024-11-23 02:06:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 498 states have (on average 1.1124497991967872) internal successors, (554), 503 states have internal predecessors, (554), 214 states have call successors, (224), 96 states have call predecessors, (224), 90 states have return successors, (400), 202 states have call predecessors, (400), 214 states have call successors, (400) [2024-11-23 02:06:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1178 transitions. [2024-11-23 02:06:40,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 802 states and 1178 transitions. [2024-11-23 02:06:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:06:40,860 INFO L425 stractBuchiCegarLoop]: Abstraction has 802 states and 1178 transitions. [2024-11-23 02:06:40,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-23 02:06:40,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 802 states and 1178 transitions. [2024-11-23 02:06:40,864 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2024-11-23 02:06:40,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:40,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:40,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:40,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:06:40,865 INFO L745 eck$LassoCheckResult]: Stem: 13439#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13386#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; 13387#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; 13409#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; 13397#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13398#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13602#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; 13377#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13378#$Ultimate##0 ~n := #in~n; 13606#L25 assume ~n <= 0;#res := 1; 13605#factFINAL assume true; 13604#factEXIT >#72#return; 13429#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13430#$Ultimate##0 ~n := #in~n; 13709#L25 assume !(~n <= 0); 13711#L26 call #t~ret0 := fact(~n - 1);< 13727#$Ultimate##0 ~n := #in~n; 13729#L25 assume ~n <= 0;#res := 1; 13728#factFINAL assume true; 13726#factEXIT >#70#return; 13712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13705#factFINAL assume true; 13706#factEXIT >#74#return; 13371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13373#$Ultimate##0 ~n := #in~n; 13713#L25 assume ~n <= 0;#res := 1; 13714#factFINAL assume true; 13701#factEXIT >#76#return; 13702#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; 13420#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; 13421#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13438#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 14003#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; 13961#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13983#$Ultimate##0 ~n := #in~n; 13984#L25 assume !(~n <= 0); 13990#L26 call #t~ret0 := fact(~n - 1);< 13992#$Ultimate##0 [2024-11-23 02:06:40,865 INFO L747 eck$LassoCheckResult]: Loop: 13992#$Ultimate##0 ~n := #in~n; 14006#L25 assume !(~n <= 0); 13989#L26 call #t~ret0 := fact(~n - 1);< 13992#$Ultimate##0 [2024-11-23 02:06:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1727773308, now seen corresponding path program 1 times [2024-11-23 02:06:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807706282] [2024-11-23 02:06:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:40,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-23 02:06:40,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:40,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807706282] [2024-11-23 02:06:40,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807706282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:40,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348996460] [2024-11-23 02:06:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:40,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:40,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:40,939 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:40,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-11-23 02:06:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:40,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:06:40,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-23 02:06:40,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-23 02:06:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348996460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:41,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-23 02:06:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764915609] [2024-11-23 02:06:41,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:41,041 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:06:41,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 2 times [2024-11-23 02:06:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:41,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139775760] [2024-11-23 02:06:41,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:41,043 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:06:41,043 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:41,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:41,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:41,064 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:41,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:41,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:41,064 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:41,064 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:41,064 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:41,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:41,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2024-11-23 02:06:41,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:41,064 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:41,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,088 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:41,088 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:41,089 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-11-23 02:06:41,090 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-11-23 02:06:41,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:41,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:41,106 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-11-23 02:06:41,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:41,108 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-11-23 02:06:41,109 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-11-23 02:06:41,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:41,110 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:41,131 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:41,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:41,135 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:41,135 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:41,135 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:41,135 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:41,135 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:41,135 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,135 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:41,135 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:41,135 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2024-11-23 02:06:41,135 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:41,135 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:41,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:41,156 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:41,156 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:41,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:41,157 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:41,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-23 02:06:41,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:41,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:41,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:41,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:41,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:41,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:41,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:41,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:41,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:41,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-23 02:06:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:41,177 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:41,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-23 02:06:41,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:41,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:41,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:41,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:41,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:41,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:41,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:41,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:41,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:41,192 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:41,192 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:06:41,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:41,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:41,194 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:41,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-23 02:06:41,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:41,195 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:41,195 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:41,195 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-11-23 02:06:41,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:41,200 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:41,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:41,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:06:41,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:41,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:06:41,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:06:41,403 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-11-23 02:06:41,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 802 states and 1178 transitions. cyclomatic complexity: 394 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 02:06:41,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 802 states and 1178 transitions. cyclomatic complexity: 394. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 856 states and 1240 transitions. Complement of second has 17 states. [2024-11-23 02:06:41,482 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-11-23 02:06:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 02:06:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-23 02:06:41,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2024-11-23 02:06:41,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:41,483 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:06:41,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:41,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:06:41,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:41,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:06:41,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:06:41,677 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-11-23 02:06:41,677 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 802 states and 1178 transitions. cyclomatic complexity: 394 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 02:06:41,742 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 802 states and 1178 transitions. cyclomatic complexity: 394. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 856 states and 1240 transitions. Complement of second has 17 states. [2024-11-23 02:06:41,743 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-11-23 02:06:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 02:06:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-23 02:06:41,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2024-11-23 02:06:41,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:41,744 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:06:41,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:41,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:06:41,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:41,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:06:41,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:06:41,949 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-11-23 02:06:41,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 802 states and 1178 transitions. cyclomatic complexity: 394 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 02:06:42,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:42,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 802 states and 1178 transitions. cyclomatic complexity: 394. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 970 states and 1372 transitions. Complement of second has 19 states. [2024-11-23 02:06:42,045 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-11-23 02:06:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 02:06:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2024-11-23 02:06:42,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 37 letters. Loop has 3 letters. [2024-11-23 02:06:42,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:42,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 40 letters. Loop has 3 letters. [2024-11-23 02:06:42,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:42,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 37 letters. Loop has 6 letters. [2024-11-23 02:06:42,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:42,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 970 states and 1372 transitions. [2024-11-23 02:06:42,054 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 102 [2024-11-23 02:06:42,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 970 states to 852 states and 1248 transitions. [2024-11-23 02:06:42,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2024-11-23 02:06:42,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2024-11-23 02:06:42,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 852 states and 1248 transitions. [2024-11-23 02:06:42,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:42,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 852 states and 1248 transitions. [2024-11-23 02:06:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states and 1248 transitions. [2024-11-23 02:06:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 802. [2024-11-23 02:06:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 500 states have (on average 1.116) internal successors, (558), 501 states have internal predecessors, (558), 210 states have call successors, (220), 98 states have call predecessors, (220), 92 states have return successors, (392), 202 states have call predecessors, (392), 210 states have call successors, (392) [2024-11-23 02:06:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1170 transitions. [2024-11-23 02:06:42,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 802 states and 1170 transitions. [2024-11-23 02:06:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:06:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:06:42,086 INFO L87 Difference]: Start difference. First operand 802 states and 1170 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-23 02:06:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:42,171 INFO L93 Difference]: Finished difference Result 762 states and 1082 transitions. [2024-11-23 02:06:42,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 762 states and 1082 transitions. [2024-11-23 02:06:42,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 105 [2024-11-23 02:06:42,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 762 states to 742 states and 1054 transitions. [2024-11-23 02:06:42,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2024-11-23 02:06:42,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2024-11-23 02:06:42,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 742 states and 1054 transitions. [2024-11-23 02:06:42,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:42,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 742 states and 1054 transitions. [2024-11-23 02:06:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 1054 transitions. [2024-11-23 02:06:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 712. [2024-11-23 02:06:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 446 states have (on average 1.116591928251121) internal successors, (498), 445 states have internal predecessors, (498), 184 states have call successors, (190), 88 states have call predecessors, (190), 82 states have return successors, (336), 178 states have call predecessors, (336), 184 states have call successors, (336) [2024-11-23 02:06:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1024 transitions. [2024-11-23 02:06:42,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 712 states and 1024 transitions. [2024-11-23 02:06:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 02:06:42,204 INFO L425 stractBuchiCegarLoop]: Abstraction has 712 states and 1024 transitions. [2024-11-23 02:06:42,204 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-23 02:06:42,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 712 states and 1024 transitions. [2024-11-23 02:06:42,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 99 [2024-11-23 02:06:42,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:42,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:42,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 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, 1, 1, 1, 1] [2024-11-23 02:06:42,209 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-11-23 02:06:42,209 INFO L745 eck$LassoCheckResult]: Stem: 19173#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 19111#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; 19112#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; 19134#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; 19121#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 19122#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19544#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; 19109#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19110#$Ultimate##0 ~n := #in~n; 19627#L25 assume ~n <= 0;#res := 1; 19626#factFINAL assume true; 19620#factEXIT >#72#return; 19160#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19161#$Ultimate##0 ~n := #in~n; 19623#L25 assume ~n <= 0;#res := 1; 19622#factFINAL assume true; 19621#factEXIT >#74#return; 19097#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19099#$Ultimate##0 ~n := #in~n; 19678#L25 assume ~n <= 0;#res := 1; 19677#factFINAL assume true; 19673#factEXIT >#76#return; 19132#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; 19133#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; 19709#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19707#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; 19687#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19706#$Ultimate##0 ~n := #in~n; 19750#L25 assume ~n <= 0;#res := 1; 19749#factFINAL assume true; 19748#factEXIT >#78#return; 19744#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19746#$Ultimate##0 ~n := #in~n; 19791#L25 assume ~n <= 0;#res := 1; 19789#factFINAL assume true; 19788#factEXIT >#80#return; 19119#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19786#$Ultimate##0 ~n := #in~n; 19784#L25 assume !(~n <= 0); 19105#L26 call #t~ret0 := fact(~n - 1);< 19120#$Ultimate##0 ~n := #in~n; 19779#L25 assume ~n <= 0;#res := 1; 19103#factFINAL assume true; 19106#factEXIT >#70#return; 19763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19790#factFINAL assume true; 19787#factEXIT >#82#return; 19496#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; 19458#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; 19459#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19184#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 19185#L42-4 havoc main_~k~0#1; 19128#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19129#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 19300#L42-3 [2024-11-23 02:06:42,209 INFO L747 eck$LassoCheckResult]: Loop: 19300#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19295#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; 19296#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19311#$Ultimate##0 ~n := #in~n; 19319#L25 assume !(~n <= 0); 19240#L26 call #t~ret0 := fact(~n - 1);< 19257#$Ultimate##0 ~n := #in~n; 19256#L25 assume !(~n <= 0); 19248#L26 call #t~ret0 := fact(~n - 1);< 19255#$Ultimate##0 ~n := #in~n; 19259#L25 assume ~n <= 0;#res := 1; 19270#factFINAL assume true; 19266#factEXIT >#70#return; 19262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19247#factFINAL assume true; 19249#factEXIT >#70#return; 19268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19317#factFINAL assume true; 19303#factEXIT >#72#return; 19306#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19311#$Ultimate##0 ~n := #in~n; 19319#L25 assume ~n <= 0;#res := 1; 19312#factFINAL assume true; 19308#factEXIT >#74#return; 19305#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19307#$Ultimate##0 ~n := #in~n; 19318#L25 assume !(~n <= 0); 19240#L26 call #t~ret0 := fact(~n - 1);< 19257#$Ultimate##0 ~n := #in~n; 19258#L25 assume ~n <= 0;#res := 1; 19261#factFINAL assume true; 19235#factEXIT >#70#return; 19245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19316#factFINAL assume true; 19314#factEXIT >#76#return; 19229#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; 19297#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; 19275#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19276#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19271#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; 19207#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19232#$Ultimate##0 ~n := #in~n; 19286#L25 assume !(~n <= 0); 19241#L26 call #t~ret0 := fact(~n - 1);< 19257#$Ultimate##0 ~n := #in~n; 19256#L25 assume !(~n <= 0); 19248#L26 call #t~ret0 := fact(~n - 1);< 19255#$Ultimate##0 ~n := #in~n; 19259#L25 assume ~n <= 0;#res := 1; 19270#factFINAL assume true; 19266#factEXIT >#70#return; 19262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19247#factFINAL assume true; 19249#factEXIT >#70#return; 19233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19230#factFINAL assume true; 19231#factEXIT >#72#return; 19208#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19232#$Ultimate##0 ~n := #in~n; 19286#L25 assume !(~n <= 0); 19241#L26 call #t~ret0 := fact(~n - 1);< 19257#$Ultimate##0 ~n := #in~n; 19258#L25 assume ~n <= 0;#res := 1; 19261#factFINAL assume true; 19235#factEXIT >#70#return; 19242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19272#factFINAL assume true; 19202#factEXIT >#74#return; 19224#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19232#$Ultimate##0 ~n := #in~n; 19286#L25 assume ~n <= 0;#res := 1; 19264#factFINAL assume true; 19283#factEXIT >#76#return; 19282#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; 19281#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; 19280#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19279#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19277#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; 19219#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19232#$Ultimate##0 ~n := #in~n; 19286#L25 assume !(~n <= 0); 19241#L26 call #t~ret0 := fact(~n - 1);< 19257#$Ultimate##0 ~n := #in~n; 19258#L25 assume ~n <= 0;#res := 1; 19261#factFINAL assume true; 19235#factEXIT >#70#return; 19242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19272#factFINAL assume true; 19202#factEXIT >#78#return; 19204#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19269#$Ultimate##0 ~n := #in~n; 19263#L25 assume ~n <= 0;#res := 1; 19264#factFINAL assume true; 19283#factEXIT >#80#return; 19218#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19175#$Ultimate##0 ~n := #in~n; 19265#L25 assume !(~n <= 0); 19241#L26 call #t~ret0 := fact(~n - 1);< 19257#$Ultimate##0 ~n := #in~n; 19258#L25 assume ~n <= 0;#res := 1; 19261#factFINAL assume true; 19235#factEXIT >#70#return; 19242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19272#factFINAL assume true; 19202#factEXIT >#82#return; 19113#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; 19114#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; 19182#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19183#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 19177#L42-4 havoc main_~k~0#1; 19126#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19127#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 19300#L42-3 [2024-11-23 02:06:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1845867162, now seen corresponding path program 1 times [2024-11-23 02:06:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110079746] [2024-11-23 02:06:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-23 02:06:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110079746] [2024-11-23 02:06:42,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110079746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780071622] [2024-11-23 02:06:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:42,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:42,260 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-11-23 02:06:42,261 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-11-23 02:06:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:42,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:06:42,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-23 02:06:42,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 02:06:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780071622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:06:42,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 02:06:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2024-11-23 02:06:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238396236] [2024-11-23 02:06:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:06:42,320 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:06:42,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1398388112, now seen corresponding path program 6 times [2024-11-23 02:06:42,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:42,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147492160] [2024-11-23 02:06:42,320 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:06:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:42,351 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-23 02:06:42,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 15 proven. 163 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-23 02:06:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:42,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147492160] [2024-11-23 02:06:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147492160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:42,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226921277] [2024-11-23 02:06:42,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:06:42,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:42,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:42,570 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-11-23 02:06:42,571 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-11-23 02:06:42,660 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-23 02:06:42,660 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:42,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-23 02:06:42,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 15 proven. 162 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2024-11-23 02:06:42,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 15 proven. 163 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-23 02:06:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226921277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:43,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 29 [2024-11-23 02:06:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59789646] [2024-11-23 02:06:43,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:43,190 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:06:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:06:43,190 INFO L87 Difference]: Start difference. First operand 712 states and 1024 transitions. cyclomatic complexity: 326 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-11-23 02:06:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:43,279 INFO L93 Difference]: Finished difference Result 636 states and 892 transitions. [2024-11-23 02:06:43,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 636 states and 892 transitions. [2024-11-23 02:06:43,282 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 [2024-11-23 02:06:43,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 636 states to 514 states and 732 transitions. [2024-11-23 02:06:43,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2024-11-23 02:06:43,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2024-11-23 02:06:43,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 732 transitions. [2024-11-23 02:06:43,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:43,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 514 states and 732 transitions. [2024-11-23 02:06:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 732 transitions. [2024-11-23 02:06:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 490. [2024-11-23 02:06:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 310 states have (on average 1.1290322580645162) internal successors, (350), 307 states have internal predecessors, (350), 132 states have call successors, (132), 54 states have call predecessors, (132), 48 states have return successors, (226), 128 states have call predecessors, (226), 132 states have call successors, (226) [2024-11-23 02:06:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 708 transitions. [2024-11-23 02:06:43,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 490 states and 708 transitions. [2024-11-23 02:06:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 02:06:43,296 INFO L425 stractBuchiCegarLoop]: Abstraction has 490 states and 708 transitions. [2024-11-23 02:06:43,296 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-23 02:06:43,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 490 states and 708 transitions. [2024-11-23 02:06:43,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 97 [2024-11-23 02:06:43,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:43,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:43,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 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-11-23 02:06:43,299 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-11-23 02:06:43,299 INFO L745 eck$LassoCheckResult]: Stem: 21378#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 21320#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; 21321#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; 21345#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; 21379#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21545#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21544#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; 21312#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21313#$Ultimate##0 ~n := #in~n; 21557#L25 assume ~n <= 0;#res := 1; 21556#factFINAL assume true; 21555#factEXIT >#72#return; 21305#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21365#$Ultimate##0 ~n := #in~n; 21368#L25 assume ~n <= 0;#res := 1; 21316#factFINAL assume true; 21304#factEXIT >#74#return; 21306#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21310#$Ultimate##0 ~n := #in~n; 21605#L25 assume ~n <= 0;#res := 1; 21604#factFINAL assume true; 21603#factEXIT >#76#return; 21602#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; 21600#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; 21601#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 21670#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21662#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; 21300#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21301#$Ultimate##0 ~n := #in~n; 21363#L25 assume !(~n <= 0); 21358#L26 call #t~ret0 := fact(~n - 1);< 21657#$Ultimate##0 ~n := #in~n; 21707#L25 assume ~n <= 0;#res := 1; 21706#factFINAL assume true; 21651#factEXIT >#70#return; 21650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21648#factFINAL assume true; 21646#factEXIT >#78#return; 21329#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21375#$Ultimate##0 ~n := #in~n; 21654#L25 assume ~n <= 0;#res := 1; 21647#factFINAL assume true; 21645#factEXIT >#80#return; 21407#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21408#$Ultimate##0 ~n := #in~n; 21679#L25 assume !(~n <= 0); 21357#L26 call #t~ret0 := fact(~n - 1);< 21676#$Ultimate##0 ~n := #in~n; 21689#L25 assume ~n <= 0;#res := 1; 21686#factFINAL assume true; 21675#factEXIT >#70#return; 21650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21648#factFINAL assume true; 21646#factEXIT >#82#return; 21513#L30-8 [2024-11-23 02:06:43,299 INFO L747 eck$LassoCheckResult]: Loop: 21513#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; 21346#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; 21347#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 21362#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21349#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; 21350#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21661#$Ultimate##0 ~n := #in~n; 21678#L25 assume !(~n <= 0); 21357#L26 call #t~ret0 := fact(~n - 1);< 21676#$Ultimate##0 ~n := #in~n; 21689#L25 assume ~n <= 0;#res := 1; 21686#factFINAL assume true; 21675#factEXIT >#70#return; 21650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21648#factFINAL assume true; 21646#factEXIT >#78#return; 21328#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21375#$Ultimate##0 ~n := #in~n; 21654#L25 assume ~n <= 0;#res := 1; 21647#factFINAL assume true; 21645#factEXIT >#80#return; 21512#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21408#$Ultimate##0 ~n := #in~n; 21679#L25 assume !(~n <= 0); 21357#L26 call #t~ret0 := fact(~n - 1);< 21676#$Ultimate##0 ~n := #in~n; 21687#L25 assume !(~n <= 0); 21356#L26 call #t~ret0 := fact(~n - 1);< 21674#$Ultimate##0 ~n := #in~n; 21683#L25 assume ~n <= 0;#res := 1; 21682#factFINAL assume true; 21681#factEXIT >#70#return; 21355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21359#factFINAL assume true; 21656#factEXIT >#70#return; 21655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21653#factFINAL assume true; 21511#factEXIT >#82#return; 21513#L30-8 [2024-11-23 02:06:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 816659251, now seen corresponding path program 1 times [2024-11-23 02:06:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579902478] [2024-11-23 02:06:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331674844] [2024-11-23 02:06:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:43,309 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-11-23 02:06:43,310 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-11-23 02:06:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:43,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:43,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:43,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash 738031228, now seen corresponding path program 1 times [2024-11-23 02:06:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880879414] [2024-11-23 02:06:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003214590] [2024-11-23 02:06:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:43,380 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-11-23 02:06:43,382 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-11-23 02:06:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:43,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:43,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash -300499922, now seen corresponding path program 1 times [2024-11-23 02:06:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33819240] [2024-11-23 02:06:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 61 proven. 31 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-23 02:06:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33819240] [2024-11-23 02:06:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33819240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087305394] [2024-11-23 02:06:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:43,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:43,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:43,523 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-11-23 02:06:43,524 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-11-23 02:06:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:43,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:06:43,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 233 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-11-23 02:06:43,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 61 proven. 32 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-23 02:06:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087305394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:43,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 11 [2024-11-23 02:06:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065597183] [2024-11-23 02:06:43,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:44,025 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:44,025 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:44,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:44,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:44,025 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:44,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:44,026 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:44,026 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2024-11-23 02:06:44,026 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:44,026 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:44,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,107 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:44,107 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:44,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,109 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:44,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-23 02:06:44,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:44,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:44,122 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:44,123 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-11-23 02:06:44,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-23 02:06:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,131 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:44,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-23 02:06:44,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:44,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:44,144 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:44,144 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-11-23 02:06:44,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,152 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:44,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-23 02:06:44,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:44,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:44,166 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:44,166 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-11-23 02:06:44,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,174 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-11-23 02:06:44,175 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-11-23 02:06:44,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:44,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:44,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:44,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,194 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-11-23 02:06:44,195 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-11-23 02:06:44,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:44,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:44,208 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:44,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:44,214 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:44,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:44,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:44,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:44,214 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:44,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:44,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:44,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2024-11-23 02:06:44,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:44,214 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:44,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:44,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:44,290 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,293 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-11-23 02:06:44,296 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-11-23 02:06:44,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:44,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:44,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:44,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:44,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:44,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:44,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:44,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:44,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:44,315 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-11-23 02:06:44,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,316 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-11-23 02:06:44,317 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-11-23 02:06:44,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:44,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:44,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:44,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:44,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:44,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:44,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:44,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:44,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:44,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-23 02:06:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,338 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-11-23 02:06:44,338 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-11-23 02:06:44,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:44,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:44,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:44,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:44,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:44,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:44,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:44,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:44,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:44,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,357 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-11-23 02:06:44,357 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-11-23 02:06:44,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:44,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:44,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:44,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:44,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:44,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:44,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:44,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:44,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:44,371 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:44,371 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:06:44,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:44,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:44,372 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-11-23 02:06:44,373 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-11-23 02:06:44,373 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:44,374 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:44,374 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:44,374 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-11-23 02:06:44,379 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-11-23 02:06:44,379 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:44,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-23 02:06:44,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:44,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-23 02:06:44,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:06:44,733 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2024-11-23 02:06:44,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 490 states and 708 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-23 02:06:44,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 490 states and 708 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Result 721 states and 981 transitions. Complement of second has 49 states. [2024-11-23 02:06:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-23 02:06:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2024-11-23 02:06:44,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 65 transitions. Stem has 54 letters. Loop has 38 letters. [2024-11-23 02:06:44,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:44,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 65 transitions. Stem has 92 letters. Loop has 38 letters. [2024-11-23 02:06:44,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:44,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 65 transitions. Stem has 54 letters. Loop has 76 letters. [2024-11-23 02:06:44,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:44,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 981 transitions. [2024-11-23 02:06:44,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-11-23 02:06:44,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 705 states and 959 transitions. [2024-11-23 02:06:44,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2024-11-23 02:06:44,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 286 [2024-11-23 02:06:44,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 959 transitions. [2024-11-23 02:06:44,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:44,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 959 transitions. [2024-11-23 02:06:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 959 transitions. [2024-11-23 02:06:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 668. [2024-11-23 02:06:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 430 states have (on average 1.130232558139535) internal successors, (486), 427 states have internal predecessors, (486), 158 states have call successors, (160), 84 states have call predecessors, (160), 80 states have return successors, (268), 156 states have call predecessors, (268), 158 states have call successors, (268) [2024-11-23 02:06:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 914 transitions. [2024-11-23 02:06:44,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 668 states and 914 transitions. [2024-11-23 02:06:44,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 02:06:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-23 02:06:44,931 INFO L87 Difference]: Start difference. First operand 668 states and 914 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-23 02:06:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:45,115 INFO L93 Difference]: Finished difference Result 734 states and 996 transitions. [2024-11-23 02:06:45,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 734 states and 996 transitions. [2024-11-23 02:06:45,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 95 [2024-11-23 02:06:45,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 734 states to 620 states and 846 transitions. [2024-11-23 02:06:45,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2024-11-23 02:06:45,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2024-11-23 02:06:45,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 620 states and 846 transitions. [2024-11-23 02:06:45,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:45,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 620 states and 846 transitions. [2024-11-23 02:06:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states and 846 transitions. [2024-11-23 02:06:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 554. [2024-11-23 02:06:45,148 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-11-23 02:06:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 368 states have (on average 1.1195652173913044) internal successors, (412), 367 states have internal predecessors, (412), 126 states have call successors, (126), 64 states have call predecessors, (126), 60 states have return successors, (202), 122 states have call predecessors, (202), 126 states have call successors, (202) [2024-11-23 02:06:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 740 transitions. [2024-11-23 02:06:45,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 554 states and 740 transitions. [2024-11-23 02:06:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:06:45,155 INFO L425 stractBuchiCegarLoop]: Abstraction has 554 states and 740 transitions. [2024-11-23 02:06:45,155 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-23 02:06:45,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 554 states and 740 transitions. [2024-11-23 02:06:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-11-23 02:06:45,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:45,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:45,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 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-11-23 02:06:45,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:45,158 INFO L745 eck$LassoCheckResult]: Stem: 24907#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 24854#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; 24855#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; 24879#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; 24866#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25046#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; 24843#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24844#$Ultimate##0 ~n := #in~n; 25054#L25 assume ~n <= 0;#res := 1; 25053#factFINAL assume true; 25052#factEXIT >#72#return; 24895#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24896#$Ultimate##0 ~n := #in~n; 25112#L25 assume ~n <= 0;#res := 1; 25110#factFINAL assume true; 25109#factEXIT >#74#return; 24839#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24840#$Ultimate##0 ~n := #in~n; 25158#L25 assume ~n <= 0;#res := 1; 25157#factFINAL assume true; 25153#factEXIT >#76#return; 25146#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; 24885#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; 24886#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25114#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25152#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; 25150#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25151#$Ultimate##0 ~n := #in~n; 25163#L25 assume !(~n <= 0); 24849#L26 call #t~ret0 := fact(~n - 1);< 25161#$Ultimate##0 ~n := #in~n; 25180#L25 assume ~n <= 0;#res := 1; 25173#factFINAL assume true; 25167#factEXIT >#70#return; 25164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25154#factFINAL assume true; 25149#factEXIT >#78#return; 24901#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24902#$Ultimate##0 ~n := #in~n; 25171#L25 assume ~n <= 0;#res := 1; 25165#factFINAL assume true; 25086#factEXIT >#80#return; 25088#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25155#$Ultimate##0 ~n := #in~n; 25185#L25 assume !(~n <= 0); 24848#L26 call #t~ret0 := fact(~n - 1);< 25170#$Ultimate##0 ~n := #in~n; 25181#L25 assume ~n <= 0;#res := 1; 25174#factFINAL assume true; 25168#factEXIT >#70#return; 25164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25154#factFINAL assume true; 25149#factEXIT >#82#return; 24856#L30-8 [2024-11-23 02:06:45,158 INFO L747 eck$LassoCheckResult]: Loop: 24856#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; 24857#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; 24880#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25113#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25111#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; 24829#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24830#$Ultimate##0 ~n := #in~n; 25192#L25 assume !(~n <= 0); 25176#L26 call #t~ret0 := fact(~n - 1);< 25179#$Ultimate##0 ~n := #in~n; 25200#L25 assume !(~n <= 0); 25177#L26 call #t~ret0 := fact(~n - 1);< 25197#$Ultimate##0 ~n := #in~n; 25201#L25 assume ~n <= 0;#res := 1; 25193#factFINAL assume true; 25194#factEXIT >#70#return; 25178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25196#factFINAL assume true; 25175#factEXIT >#70#return; 25172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25166#factFINAL assume true; 25148#factEXIT >#78#return; 24861#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24899#$Ultimate##0 ~n := #in~n; 24891#L25 assume !(~n <= 0); 24860#L26 call #t~ret0 := fact(~n - 1);< 24862#$Ultimate##0 ~n := #in~n; 25191#L25 assume ~n <= 0;#res := 1; 25190#factFINAL assume true; 25189#factEXIT >#70#return; 25188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25187#factFINAL assume true; 25186#factEXIT >#80#return; 24908#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24909#$Ultimate##0 ~n := #in~n; 25182#L25 assume !(~n <= 0); 25176#L26 call #t~ret0 := fact(~n - 1);< 25179#$Ultimate##0 ~n := #in~n; 25191#L25 assume ~n <= 0;#res := 1; 25190#factFINAL assume true; 25189#factEXIT >#70#return; 25188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25187#factFINAL assume true; 25186#factEXIT >#82#return; 24856#L30-8 [2024-11-23 02:06:45,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 816659251, now seen corresponding path program 2 times [2024-11-23 02:06:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102007853] [2024-11-23 02:06:45,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:45,166 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:45,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1892821624] [2024-11-23 02:06:45,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:45,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,169 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2024-11-23 02:06:45,215 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:45,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:45,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:45,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 75453436, now seen corresponding path program 2 times [2024-11-23 02:06:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959411908] [2024-11-23 02:06:45,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:45,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:45,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386542105] [2024-11-23 02:06:45,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:45,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:45,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,243 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:45,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2024-11-23 02:06:45,287 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:45,287 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:45,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:45,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:45,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:45,303 INFO L85 PathProgramCache]: Analyzing trace with hash -437908434, now seen corresponding path program 2 times [2024-11-23 02:06:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55276031] [2024-11-23 02:06:45,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:45,311 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:45,311 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 96 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-23 02:06:45,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:45,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55276031] [2024-11-23 02:06:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55276031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713145949] [2024-11-23 02:06:45,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,417 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2024-11-23 02:06:45,473 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:45,473 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:45,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:06:45,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 158 proven. 3 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-23 02:06:45,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-11-23 02:06:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713145949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:45,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2024-11-23 02:06:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713552207] [2024-11-23 02:06:45,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:45,841 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:45,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:45,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:45,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:45,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:45,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:45,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:45,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:45,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2024-11-23 02:06:45,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:45,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:45,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:45,917 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:45,917 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,919 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-11-23 02:06:45,920 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-11-23 02:06:45,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:45,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:45,931 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:45,931 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-11-23 02:06:45,936 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-11-23 02:06:45,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:45,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,938 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-11-23 02:06:45,938 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-11-23 02:06:45,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:45,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:45,950 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:45,950 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:45,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:45,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,957 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:45,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-23 02:06:45,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:45,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:45,983 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:45,983 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:45,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:45,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:45,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:45,990 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:45,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-23 02:06:45,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:45,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,002 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,002 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:46,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,009 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-11-23 02:06:46,009 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-11-23 02:06:46,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,021 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,021 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-11-23 02:06:46,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,027 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-11-23 02:06:46,028 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-11-23 02:06:46,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,040 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,041 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:46,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,048 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-11-23 02:06:46,049 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-11-23 02:06:46,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,066 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,066 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=2} Honda state: {ULTIMATE.start_main_~x~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:46,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,073 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-11-23 02:06:46,074 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-11-23 02:06:46,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,085 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,085 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-11-23 02:06:46,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,091 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-11-23 02:06:46,092 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-11-23 02:06:46,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,104 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,105 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=1} Honda state: {ULTIMATE.start_main_~n~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:46,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,111 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-11-23 02:06:46,111 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-11-23 02:06:46,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,123 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,123 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:46,128 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-11-23 02:06:46,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,130 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-11-23 02:06:46,130 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-11-23 02:06:46,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,142 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:46,142 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-11-23 02:06:46,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-23 02:06:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,148 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-11-23 02:06:46,149 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-11-23 02:06:46,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:46,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-23 02:06:46,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,166 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-11-23 02:06:46,167 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-11-23 02:06:46,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:46,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:46,179 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:46,184 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-11-23 02:06:46,184 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:46,184 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:46,184 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:46,184 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:46,184 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:46,184 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,184 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:46,184 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:46,184 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2024-11-23 02:06:46,184 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:46,184 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:46,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:46,250 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:46,250 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,251 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-11-23 02:06:46,252 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-11-23 02:06:46,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-23 02:06:46,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,270 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-11-23 02:06:46,270 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-11-23 02:06:46,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,289 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-11-23 02:06:46,290 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-11-23 02:06:46,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,308 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-11-23 02:06:46,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,309 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-11-23 02:06:46,309 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-11-23 02:06:46,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,328 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-11-23 02:06:46,329 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-11-23 02:06:46,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,350 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-11-23 02:06:46,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,352 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-11-23 02:06:46,353 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-11-23 02:06:46,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:46,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,374 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-11-23 02:06:46,375 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-11-23 02:06:46,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,393 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-11-23 02:06:46,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,394 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-11-23 02:06:46,395 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-11-23 02:06:46,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,412 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-11-23 02:06:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,413 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-11-23 02:06:46,414 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-11-23 02:06:46,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,431 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-11-23 02:06:46,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,433 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-11-23 02:06:46,433 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-11-23 02:06:46,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-23 02:06:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,451 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-11-23 02:06:46,452 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-11-23 02:06:46,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:46,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-11-23 02:06:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,471 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-11-23 02:06:46,471 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-11-23 02:06:46,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:46,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:46,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:46,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:46,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:46,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:46,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:46,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:46,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:46,485 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:46,485 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:06:46,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:46,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:46,487 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-11-23 02:06:46,488 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-11-23 02:06:46,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:46,488 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:46,488 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:46,488 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2024-11-23 02:06:46,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-11-23 02:06:46,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:46,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-23 02:06:46,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:46,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-23 02:06:46,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-23 02:06:46,898 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2024-11-23 02:06:46,898 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 554 states and 740 transitions. cyclomatic complexity: 197 Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-23 02:06:47,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 554 states and 740 transitions. cyclomatic complexity: 197. Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Result 767 states and 1007 transitions. Complement of second has 61 states. [2024-11-23 02:06:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-23 02:06:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2024-11-23 02:06:47,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 54 letters. Loop has 44 letters. [2024-11-23 02:06:47,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:47,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 98 letters. Loop has 44 letters. [2024-11-23 02:06:47,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:47,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 71 transitions. Stem has 54 letters. Loop has 88 letters. [2024-11-23 02:06:47,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:47,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 767 states and 1007 transitions. [2024-11-23 02:06:47,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-11-23 02:06:47,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 767 states to 767 states and 1007 transitions. [2024-11-23 02:06:47,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2024-11-23 02:06:47,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2024-11-23 02:06:47,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 1007 transitions. [2024-11-23 02:06:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:47,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 767 states and 1007 transitions. [2024-11-23 02:06:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 1007 transitions. [2024-11-23 02:06:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 710. [2024-11-23 02:06:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 470 states have (on average 1.123404255319149) internal successors, (528), 467 states have internal predecessors, (528), 152 states have call successors, (154), 84 states have call predecessors, (154), 88 states have return successors, (260), 158 states have call predecessors, (260), 152 states have call successors, (260) [2024-11-23 02:06:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 942 transitions. [2024-11-23 02:06:47,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 710 states and 942 transitions. [2024-11-23 02:06:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 02:06:47,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-23 02:06:47,121 INFO L87 Difference]: Start difference. First operand 710 states and 942 transitions. Second operand has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 9 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-23 02:06:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:47,494 INFO L93 Difference]: Finished difference Result 796 states and 1010 transitions. [2024-11-23 02:06:47,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 1010 transitions. [2024-11-23 02:06:47,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2024-11-23 02:06:47,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 760 states and 974 transitions. [2024-11-23 02:06:47,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2024-11-23 02:06:47,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2024-11-23 02:06:47,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 760 states and 974 transitions. [2024-11-23 02:06:47,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:47,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 760 states and 974 transitions. [2024-11-23 02:06:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 974 transitions. [2024-11-23 02:06:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 664. [2024-11-23 02:06:47,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-11-23 02:06:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 444 states have (on average 1.0990990990990992) internal successors, (488), 437 states have internal predecessors, (488), 140 states have call successors, (142), 78 states have call predecessors, (142), 80 states have return successors, (224), 148 states have call predecessors, (224), 140 states have call successors, (224) [2024-11-23 02:06:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 854 transitions. [2024-11-23 02:06:47,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 664 states and 854 transitions. [2024-11-23 02:06:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 02:06:47,539 INFO L425 stractBuchiCegarLoop]: Abstraction has 664 states and 854 transitions. [2024-11-23 02:06:47,539 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-23 02:06:47,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 664 states and 854 transitions. [2024-11-23 02:06:47,542 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-11-23 02:06:47,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:47,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:47,543 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-11-23 02:06:47,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 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-11-23 02:06:47,544 INFO L745 eck$LassoCheckResult]: Stem: 28747#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 28691#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; 28692#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; 28712#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; 28748#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 28896#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29106#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; 29102#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29103#$Ultimate##0 ~n := #in~n; 29107#L25 assume ~n <= 0;#res := 1; 29105#factFINAL assume true; 29101#factEXIT >#72#return; 29097#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29098#$Ultimate##0 ~n := #in~n; 29104#L25 assume ~n <= 0;#res := 1; 29100#factFINAL assume true; 29096#factEXIT >#74#return; 29093#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29094#$Ultimate##0 ~n := #in~n; 29099#L25 assume ~n <= 0;#res := 1; 29095#factFINAL assume true; 29092#factEXIT >#76#return; 29091#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; 29090#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; 29089#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29085#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29083#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; 29069#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29082#$Ultimate##0 ~n := #in~n; 29117#L25 assume !(~n <= 0); 29113#L26 call #t~ret0 := fact(~n - 1);< 29116#$Ultimate##0 ~n := #in~n; 29120#L25 assume ~n <= 0;#res := 1; 29119#factFINAL assume true; 29118#factEXIT >#70#return; 29084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29081#factFINAL assume true; 29067#factEXIT >#78#return; 29070#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29073#$Ultimate##0 ~n := #in~n; 29076#L25 assume ~n <= 0;#res := 1; 29075#factFINAL assume true; 29072#factEXIT >#80#return; 29068#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29071#$Ultimate##0 ~n := #in~n; 29108#L25 assume !(~n <= 0); 29087#L26 call #t~ret0 := fact(~n - 1);< 29088#$Ultimate##0 ~n := #in~n; 29123#L25 assume ~n <= 0;#res := 1; 29122#factFINAL assume true; 29086#factEXIT >#70#return; 29084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29081#factFINAL assume true; 29067#factEXIT >#82#return; 29062#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; 29063#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; 29275#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28755#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 28750#L42-4 havoc main_~k~0#1; 28710#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28711#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 28702#L42-3 [2024-11-23 02:06:47,544 INFO L747 eck$LassoCheckResult]: Loop: 28702#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28832#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; 28833#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28891#$Ultimate##0 ~n := #in~n; 28897#L25 assume !(~n <= 0); 28817#L26 call #t~ret0 := fact(~n - 1);< 28825#$Ultimate##0 ~n := #in~n; 28952#L25 assume !(~n <= 0); 28818#L26 call #t~ret0 := fact(~n - 1);< 28939#$Ultimate##0 ~n := #in~n; 28954#L25 assume ~n <= 0;#res := 1; 28961#factFINAL assume true; 28960#factEXIT >#70#return; 28824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28938#factFINAL assume true; 28816#factEXIT >#70#return; 28822#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28892#factFINAL assume true; 28882#factEXIT >#72#return; 28884#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28891#$Ultimate##0 ~n := #in~n; 28897#L25 assume ~n <= 0;#res := 1; 28894#factFINAL assume true; 28886#factEXIT >#74#return; 28784#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28785#$Ultimate##0 ~n := #in~n; 28898#L25 assume !(~n <= 0); 28817#L26 call #t~ret0 := fact(~n - 1);< 28825#$Ultimate##0 ~n := #in~n; 28952#L25 assume !(~n <= 0); 28818#L26 call #t~ret0 := fact(~n - 1);< 28939#$Ultimate##0 ~n := #in~n; 28954#L25 assume ~n <= 0;#res := 1; 28961#factFINAL assume true; 28960#factEXIT >#70#return; 28824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28938#factFINAL assume true; 28816#factEXIT >#70#return; 28822#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28892#factFINAL assume true; 28882#factEXIT >#76#return; 28881#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; 28879#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; 28877#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28872#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28864#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; 28794#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28810#$Ultimate##0 ~n := #in~n; 28859#L25 assume !(~n <= 0); 28821#L26 call #t~ret0 := fact(~n - 1);< 28825#$Ultimate##0 ~n := #in~n; 28952#L25 assume !(~n <= 0); 28818#L26 call #t~ret0 := fact(~n - 1);< 28939#$Ultimate##0 ~n := #in~n; 28954#L25 assume ~n <= 0;#res := 1; 28961#factFINAL assume true; 28960#factEXIT >#70#return; 28824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28938#factFINAL assume true; 28816#factEXIT >#70#return; 28815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28812#factFINAL assume true; 28788#factEXIT >#72#return; 28801#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28810#$Ultimate##0 ~n := #in~n; 28859#L25 assume !(~n <= 0); 28821#L26 call #t~ret0 := fact(~n - 1);< 28825#$Ultimate##0 ~n := #in~n; 28885#L25 assume ~n <= 0;#res := 1; 28873#factFINAL assume true; 28865#factEXIT >#70#return; 28862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28861#factFINAL assume true; 28860#factEXIT >#74#return; 28800#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28810#$Ultimate##0 ~n := #in~n; 28859#L25 assume ~n <= 0;#res := 1; 28855#factFINAL assume true; 28850#factEXIT >#76#return; 28854#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; 28719#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; 28720#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28746#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28941#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; 28793#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28810#$Ultimate##0 ~n := #in~n; 28859#L25 assume !(~n <= 0); 28821#L26 call #t~ret0 := fact(~n - 1);< 28825#$Ultimate##0 ~n := #in~n; 28952#L25 assume !(~n <= 0); 28818#L26 call #t~ret0 := fact(~n - 1);< 28939#$Ultimate##0 ~n := #in~n; 28954#L25 assume ~n <= 0;#res := 1; 28961#factFINAL assume true; 28960#factEXIT >#70#return; 28824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28938#factFINAL assume true; 28816#factEXIT >#70#return; 28815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28812#factFINAL assume true; 28788#factEXIT >#78#return; 28806#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28856#$Ultimate##0 ~n := #in~n; 28875#L25 assume ~n <= 0;#res := 1; 28855#factFINAL assume true; 28850#factEXIT >#80#return; 28789#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28813#$Ultimate##0 ~n := #in~n; 28827#L25 assume !(~n <= 0); 28821#L26 call #t~ret0 := fact(~n - 1);< 28825#$Ultimate##0 ~n := #in~n; 28885#L25 assume ~n <= 0;#res := 1; 28873#factFINAL assume true; 28865#factEXIT >#70#return; 28862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28861#factFINAL assume true; 28860#factEXIT >#82#return; 28805#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; 28757#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; 28758#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28751#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 28749#L42-4 havoc main_~k~0#1; 28709#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28701#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 28702#L42-3 [2024-11-23 02:06:47,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 2 times [2024-11-23 02:06:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:47,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279687868] [2024-11-23 02:06:47,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:47,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:47,554 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:47,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:47,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601147161] [2024-11-23 02:06:47,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:47,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:47,558 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:47,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2024-11-23 02:06:47,612 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:47,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:47,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:47,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:47,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash 187883792, now seen corresponding path program 7 times [2024-11-23 02:06:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146446247] [2024-11-23 02:06:47,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:06:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 81 proven. 120 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-23 02:06:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146446247] [2024-11-23 02:06:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146446247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088100209] [2024-11-23 02:06:47,799 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:06:47,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:47,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:47,801 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-11-23 02:06:47,802 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-11-23 02:06:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:47,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-23 02:06:47,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 403 proven. 110 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-23 02:06:47,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 49 proven. 195 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-23 02:06:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088100209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:48,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 22 [2024-11-23 02:06:48,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466001714] [2024-11-23 02:06:48,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:48,219 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:48,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 02:06:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-23 02:06:48,220 INFO L87 Difference]: Start difference. First operand 664 states and 854 transitions. cyclomatic complexity: 205 Second operand has 22 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 20 states have internal predecessors, (52), 15 states have call successors, (29), 2 states have call predecessors, (29), 5 states have return successors, (29), 12 states have call predecessors, (29), 15 states have call successors, (29) [2024-11-23 02:06:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:48,858 INFO L93 Difference]: Finished difference Result 816 states and 1060 transitions. [2024-11-23 02:06:48,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 816 states and 1060 transitions. [2024-11-23 02:06:48,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2024-11-23 02:06:48,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 816 states to 768 states and 1002 transitions. [2024-11-23 02:06:48,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2024-11-23 02:06:48,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2024-11-23 02:06:48,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 768 states and 1002 transitions. [2024-11-23 02:06:48,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:48,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 768 states and 1002 transitions. [2024-11-23 02:06:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states and 1002 transitions. [2024-11-23 02:06:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 690. [2024-11-23 02:06:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 460 states have (on average 1.0956521739130434) internal successors, (504), 451 states have internal predecessors, (504), 150 states have call successors, (152), 82 states have call predecessors, (152), 80 states have return successors, (236), 156 states have call predecessors, (236), 150 states have call successors, (236) [2024-11-23 02:06:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 892 transitions. [2024-11-23 02:06:48,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 690 states and 892 transitions. [2024-11-23 02:06:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 02:06:48,887 INFO L425 stractBuchiCegarLoop]: Abstraction has 690 states and 892 transitions. [2024-11-23 02:06:48,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-23 02:06:48,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 690 states and 892 transitions. [2024-11-23 02:06:48,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2024-11-23 02:06:48,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:48,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:48,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 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-11-23 02:06:48,891 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-11-23 02:06:48,892 INFO L745 eck$LassoCheckResult]: Stem: 31024#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 30964#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; 30965#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; 30984#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; 31025#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 31141#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31142#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; 30953#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30954#$Ultimate##0 ~n := #in~n; 31188#L25 assume ~n <= 0;#res := 1; 31187#factFINAL assume true; 31186#factEXIT >#72#return; 31003#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31004#$Ultimate##0 ~n := #in~n; 31303#L25 assume ~n <= 0;#res := 1; 31302#factFINAL assume true; 31300#factEXIT >#74#return; 31296#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31297#$Ultimate##0 ~n := #in~n; 31301#L25 assume ~n <= 0;#res := 1; 31299#factFINAL assume true; 31295#factEXIT >#76#return; 31294#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; 31291#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; 31289#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 31285#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31284#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; 30939#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30940#$Ultimate##0 ~n := #in~n; 31298#L25 assume !(~n <= 0); 30958#L26 call #t~ret0 := fact(~n - 1);< 31292#$Ultimate##0 ~n := #in~n; 31339#L25 assume ~n <= 0;#res := 1; 31338#factFINAL assume true; 31335#factEXIT >#70#return; 31333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31331#factFINAL assume true; 31041#factEXIT >#78#return; 31018#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31019#$Ultimate##0 ~n := #in~n; 31337#L25 assume ~n <= 0;#res := 1; 31334#factFINAL assume true; 31332#factEXIT >#80#return; 30970#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31043#$Ultimate##0 ~n := #in~n; 31293#L25 assume !(~n <= 0); 30959#L26 call #t~ret0 := fact(~n - 1);< 30971#$Ultimate##0 ~n := #in~n; 31342#L25 assume ~n <= 0;#res := 1; 31341#factFINAL assume true; 31336#factEXIT >#70#return; 31333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31331#factFINAL assume true; 31041#factEXIT >#82#return; 31042#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; 30985#binomialCoefficient_returnLabel#2 [2024-11-23 02:06:48,892 INFO L747 eck$LassoCheckResult]: Loop: 30985#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; 30986#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 31235#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31234#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; 31199#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31210#$Ultimate##0 ~n := #in~n; 31229#L25 assume !(~n <= 0); 31223#L26 call #t~ret0 := fact(~n - 1);< 31227#$Ultimate##0 ~n := #in~n; 31241#L25 assume !(~n <= 0); 31224#L26 call #t~ret0 := fact(~n - 1);< 31239#$Ultimate##0 ~n := #in~n; 31241#L25 assume !(~n <= 0); 31224#L26 call #t~ret0 := fact(~n - 1);< 31239#$Ultimate##0 ~n := #in~n; 31242#L25 assume ~n <= 0;#res := 1; 31246#factFINAL assume true; 31245#factEXIT >#70#return; 31244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31238#factFINAL assume true; 31233#factEXIT >#70#return; 31226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31240#factFINAL assume true; 31221#factEXIT >#70#return; 31220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31218#factFINAL assume true; 31209#factEXIT >#78#return; 31200#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31204#$Ultimate##0 ~n := #in~n; 31216#L25 assume ~n <= 0;#res := 1; 31207#factFINAL assume true; 31198#factEXIT >#80#return; 31201#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31219#$Ultimate##0 ~n := #in~n; 31230#L25 assume !(~n <= 0); 31223#L26 call #t~ret0 := fact(~n - 1);< 31227#$Ultimate##0 ~n := #in~n; 31241#L25 assume !(~n <= 0); 31224#L26 call #t~ret0 := fact(~n - 1);< 31239#$Ultimate##0 ~n := #in~n; 31241#L25 assume !(~n <= 0); 31224#L26 call #t~ret0 := fact(~n - 1);< 31239#$Ultimate##0 ~n := #in~n; 31242#L25 assume ~n <= 0;#res := 1; 31246#factFINAL assume true; 31245#factEXIT >#70#return; 31244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31238#factFINAL assume true; 31233#factEXIT >#70#return; 31226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31240#factFINAL assume true; 31221#factEXIT >#70#return; 31220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31218#factFINAL assume true; 31209#factEXIT >#82#return; 31099#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; 30985#binomialCoefficient_returnLabel#2 [2024-11-23 02:06:48,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash -453366944, now seen corresponding path program 1 times [2024-11-23 02:06:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570625173] [2024-11-23 02:06:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:06:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600619623] [2024-11-23 02:06:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:06:48,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:48,905 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-11-23 02:06:48,906 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-11-23 02:06:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:48,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:48,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:48,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash 837206758, now seen corresponding path program 3 times [2024-11-23 02:06:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61151670] [2024-11-23 02:06:48,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:48,996 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:06:48,999 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142627948] [2024-11-23 02:06:48,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:48,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:48,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:49,001 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-11-23 02:06:49,002 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-11-23 02:06:49,182 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:06:49,182 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:49,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:49,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1336720059, now seen corresponding path program 3 times [2024-11-23 02:06:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499170679] [2024-11-23 02:06:49,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:49,230 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-23 02:06:49,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 163 proven. 15 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-11-23 02:06:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499170679] [2024-11-23 02:06:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499170679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159420739] [2024-11-23 02:06:49,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:49,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:49,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:49,337 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-11-23 02:06:49,338 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-11-23 02:06:49,411 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-23 02:06:49,411 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:49,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:06:49,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 372 proven. 13 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-23 02:06:49,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 102 proven. 80 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-23 02:06:49,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159420739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:49,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 18 [2024-11-23 02:06:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295435139] [2024-11-23 02:06:49,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:50,090 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:50,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:50,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:50,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:50,090 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:50,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:50,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:50,090 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-11-23 02:06:50,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:50,090 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:50,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,154 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:50,154 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:50,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,156 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:50,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-23 02:06:50,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,169 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,169 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=3} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:50,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-23 02:06:50,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,177 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:50,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-23 02:06:50,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,188 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,189 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-11-23 02:06:50,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-23 02:06:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,195 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:50,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-23 02:06:50,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,207 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,207 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-11-23 02:06:50,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-23 02:06:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,214 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-11-23 02:06:50,214 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-11-23 02:06:50,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,226 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,227 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-11-23 02:06:50,232 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-11-23 02:06:50,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,233 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-11-23 02:06:50,234 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-11-23 02:06:50,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,246 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,246 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-11-23 02:06:50,251 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-11-23 02:06:50,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,253 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-11-23 02:06:50,253 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-11-23 02:06:50,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,265 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,265 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-11-23 02:06:50,270 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-11-23 02:06:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,271 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-11-23 02:06:50,272 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-11-23 02:06:50,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,291 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,291 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=3} Honda state: {ULTIMATE.start_main_~x~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:50,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-11-23 02:06:50,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,297 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-11-23 02:06:50,299 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-11-23 02:06:50,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,309 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,310 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:50,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-11-23 02:06:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,318 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-11-23 02:06:50,318 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-11-23 02:06:50,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,330 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:50,330 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-11-23 02:06:50,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-11-23 02:06:50,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,337 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-11-23 02:06:50,338 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-11-23 02:06:50,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:50,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:50,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,362 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-11-23 02:06:50,362 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-11-23 02:06:50,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:50,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:50,374 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:50,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:50,380 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:50,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:50,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:50,380 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:50,380 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:50,380 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,380 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:50,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:50,380 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-11-23 02:06:50,380 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:50,381 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:50,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:50,436 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:50,436 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:50,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,437 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-11-23 02:06:50,438 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-11-23 02:06:50,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,456 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-11-23 02:06:50,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,457 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-11-23 02:06:50,458 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-11-23 02:06:50,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-11-23 02:06:50,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,477 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-11-23 02:06:50,477 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-11-23 02:06:50,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,495 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-11-23 02:06:50,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,496 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-11-23 02:06:50,497 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-11-23 02:06:50,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,515 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-11-23 02:06:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,517 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-11-23 02:06:50,517 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-11-23 02:06:50,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:50,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,537 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-11-23 02:06:50,537 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-11-23 02:06:50,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-11-23 02:06:50,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,557 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-11-23 02:06:50,558 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-11-23 02:06:50,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-11-23 02:06:50,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,576 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-11-23 02:06:50,577 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-11-23 02:06:50,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:50,596 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-11-23 02:06:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,597 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:50,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-23 02:06:50,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:50,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:50,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:50,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:50,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:50,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:50,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:50,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:50,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:50,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:50,613 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:06:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:50,614 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:50,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-23 02:06:50,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:50,616 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:50,616 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:50,616 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-11-23 02:06:50,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-23 02:06:50,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:50,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:50,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-23 02:06:50,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:50,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-23 02:06:50,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-23 02:06:51,055 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-11-23 02:06:51,056 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 690 states and 892 transitions. cyclomatic complexity: 217 Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11-23 02:06:51,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 690 states and 892 transitions. cyclomatic complexity: 217. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 1167 states and 1477 transitions. Complement of second has 61 states. [2024-11-23 02:06:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11-23 02:06:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2024-11-23 02:06:51,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 74 transitions. Stem has 55 letters. Loop has 56 letters. [2024-11-23 02:06:51,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:51,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 74 transitions. Stem has 111 letters. Loop has 56 letters. [2024-11-23 02:06:51,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:51,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 74 transitions. Stem has 55 letters. Loop has 112 letters. [2024-11-23 02:06:51,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:51,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1167 states and 1477 transitions. [2024-11-23 02:06:51,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2024-11-23 02:06:51,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1167 states to 1003 states and 1277 transitions. [2024-11-23 02:06:51,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325 [2024-11-23 02:06:51,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2024-11-23 02:06:51,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1003 states and 1277 transitions. [2024-11-23 02:06:51,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:51,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1003 states and 1277 transitions. [2024-11-23 02:06:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states and 1277 transitions. [2024-11-23 02:06:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 844. [2024-11-23 02:06:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 564 states have (on average 1.0886524822695036) internal successors, (614), 553 states have internal predecessors, (614), 168 states have call successors, (174), 102 states have call predecessors, (174), 112 states have return successors, (294), 188 states have call predecessors, (294), 168 states have call successors, (294) [2024-11-23 02:06:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1082 transitions. [2024-11-23 02:06:51,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 844 states and 1082 transitions. [2024-11-23 02:06:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 02:06:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-23 02:06:51,303 INFO L87 Difference]: Start difference. First operand 844 states and 1082 transitions. Second operand has 18 states, 16 states have (on average 3.5625) internal successors, (57), 18 states have internal predecessors, (57), 12 states have call successors, (26), 2 states have call predecessors, (26), 5 states have return successors, (27), 10 states have call predecessors, (27), 12 states have call successors, (27) [2024-11-23 02:06:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:51,776 INFO L93 Difference]: Finished difference Result 1180 states and 1633 transitions. [2024-11-23 02:06:51,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1180 states and 1633 transitions. [2024-11-23 02:06:51,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 173 [2024-11-23 02:06:51,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1180 states to 1147 states and 1592 transitions. [2024-11-23 02:06:51,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2024-11-23 02:06:51,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-23 02:06:51,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2024-11-23 02:06:51,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1147 states and 1592 transitions. [2024-11-23 02:06:51,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:51,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1147 states and 1592 transitions. [2024-11-23 02:06:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states and 1592 transitions. [2024-11-23 02:06:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 975. [2024-11-23 02:06:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 647 states have (on average 1.0819165378670788) internal successors, (700), 638 states have internal predecessors, (700), 204 states have call successors, (214), 102 states have call predecessors, (214), 124 states have return successors, (404), 234 states have call predecessors, (404), 204 states have call successors, (404) [2024-11-23 02:06:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1318 transitions. [2024-11-23 02:06:51,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 975 states and 1318 transitions. [2024-11-23 02:06:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 02:06:51,830 INFO L425 stractBuchiCegarLoop]: Abstraction has 975 states and 1318 transitions. [2024-11-23 02:06:51,830 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-23 02:06:51,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 975 states and 1318 transitions. [2024-11-23 02:06:51,832 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-23 02:06:51,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:51,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:51,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:51,833 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-11-23 02:06:51,833 INFO L745 eck$LassoCheckResult]: Stem: 36054#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 35991#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; 35992#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; 36017#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; 36004#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 36005#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36037#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; 35987#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35988#$Ultimate##0 ~n := #in~n; 36211#L25 assume ~n <= 0;#res := 1; 36210#factFINAL assume true; 36209#factEXIT >#72#return; 36039#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36040#$Ultimate##0 ~n := #in~n; 36247#L25 assume ~n <= 0;#res := 1; 36246#factFINAL assume true; 36245#factEXIT >#74#return; 35976#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35977#$Ultimate##0 ~n := #in~n; 36486#L25 assume ~n <= 0;#res := 1; 36485#factFINAL assume true; 36484#factEXIT >#76#return; 36483#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; 36482#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; 36481#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36020#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; 35964#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35965#$Ultimate##0 ~n := #in~n; 36309#L25 assume !(~n <= 0); 36024#L26 call #t~ret0 := fact(~n - 1);< 36374#$Ultimate##0 ~n := #in~n; 36337#L25 assume ~n <= 0;#res := 1; 36338#factFINAL assume true; 36375#factEXIT >#70#return; 36308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36248#factFINAL assume true; 36249#factEXIT >#78#return; 36253#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36281#$Ultimate##0 ~n := #in~n; 36295#L25 assume ~n <= 0;#res := 1; 36252#factFINAL assume true; 36254#factEXIT >#80#return; 35998#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36250#$Ultimate##0 ~n := #in~n; 36310#L25 assume !(~n <= 0); 35997#L26 call #t~ret0 := fact(~n - 1);< 35999#$Ultimate##0 ~n := #in~n; 36328#L25 assume ~n <= 0;#res := 1; 36317#factFINAL assume true; 36307#factEXIT >#70#return; 36308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36248#factFINAL assume true; 36249#factEXIT >#82#return; 36372#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; 36371#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; 36370#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36369#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36368#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; 36353#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36354#$Ultimate##0 ~n := #in~n; 36445#L25 assume !(~n <= 0); 36384#L26 call #t~ret0 := fact(~n - 1);< 36388#$Ultimate##0 ~n := #in~n; 36404#L25 assume !(~n <= 0); 36383#L26 call #t~ret0 := fact(~n - 1);< 36422#$Ultimate##0 ~n := #in~n; 36421#L25 assume ~n <= 0;#res := 1; 36419#factFINAL assume true; 36420#factEXIT >#70#return; 36442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36440#factFINAL assume true; 36412#factEXIT >#70#return; 36414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36357#factFINAL assume true; 36359#factEXIT >#78#return; 35981#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36043#$Ultimate##0 ~n := #in~n; 36044#L25 assume ~n <= 0;#res := 1; 35980#factFINAL assume true; 35983#factEXIT >#80#return; 36055#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36056#$Ultimate##0 ~n := #in~n; 36298#L25 assume !(~n <= 0); 36283#L26 call #t~ret0 := fact(~n - 1);< 36288#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36294#L25 assume ~n <= 0;#res := 1; 36306#factFINAL assume true; 36305#factEXIT >#70#return; 36304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36303#factFINAL assume true; 36301#factEXIT >#70#return; 36302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36315#factFINAL assume true; 36316#factEXIT >#82#return; 36228#L30-8 [2024-11-23 02:06:51,834 INFO L747 eck$LassoCheckResult]: Loop: 36228#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; 36311#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; 36276#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36275#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36274#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; 36227#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36273#$Ultimate##0 ~n := #in~n; 36289#L25 assume !(~n <= 0); 36285#L26 call #t~ret0 := fact(~n - 1);< 36288#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36294#L25 assume ~n <= 0;#res := 1; 36306#factFINAL assume true; 36305#factEXIT >#70#return; 36304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36303#factFINAL assume true; 36301#factEXIT >#70#return; 36300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36299#factFINAL assume true; 36296#factEXIT >#70#return; 36287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36291#factFINAL assume true; 36282#factEXIT >#70#return; 36280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36278#factFINAL assume true; 36225#factEXIT >#78#return; 36047#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36048#$Ultimate##0 ~n := #in~n; 36255#L25 assume ~n <= 0;#res := 1; 36256#factFINAL assume true; 36251#factEXIT >#80#return; 36226#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36279#$Ultimate##0 ~n := #in~n; 36290#L25 assume !(~n <= 0); 36285#L26 call #t~ret0 := fact(~n - 1);< 36288#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36293#L25 assume !(~n <= 0); 36284#L26 call #t~ret0 := fact(~n - 1);< 36292#$Ultimate##0 ~n := #in~n; 36294#L25 assume ~n <= 0;#res := 1; 36306#factFINAL assume true; 36305#factEXIT >#70#return; 36304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36303#factFINAL assume true; 36301#factEXIT >#70#return; 36300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36299#factFINAL assume true; 36296#factEXIT >#70#return; 36287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36291#factFINAL assume true; 36282#factEXIT >#70#return; 36280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36278#factFINAL assume true; 36225#factEXIT >#82#return; 36228#L30-8 [2024-11-23 02:06:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 4 times [2024-11-23 02:06:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090966320] [2024-11-23 02:06:51,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:51,850 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:51,850 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937478118] [2024-11-23 02:06:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:51,853 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-11-23 02:06:51,856 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-11-23 02:06:51,926 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:51,926 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:51,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:51,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1739714684, now seen corresponding path program 4 times [2024-11-23 02:06:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:51,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174241680] [2024-11-23 02:06:51,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:51,972 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:51,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652643050] [2024-11-23 02:06:51,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:51,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:51,978 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-11-23 02:06:51,980 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-11-23 02:06:52,037 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:52,037 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:52,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:52,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:52,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 114127657, now seen corresponding path program 5 times [2024-11-23 02:06:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132682798] [2024-11-23 02:06:52,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:52,076 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-11-23 02:06:52,079 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 384 proven. 193 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2024-11-23 02:06:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:52,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132682798] [2024-11-23 02:06:52,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132682798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:52,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118358394] [2024-11-23 02:06:52,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:52,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:52,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:52,563 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-11-23 02:06:52,564 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-11-23 02:06:52,675 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-11-23 02:06:52,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:52,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-23 02:06:52,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 364 proven. 27 refuted. 0 times theorem prover too weak. 1117 trivial. 0 not checked. [2024-11-23 02:06:52,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 364 proven. 36 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-23 02:06:53,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118358394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:53,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:53,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 14] total 29 [2024-11-23 02:06:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741854900] [2024-11-23 02:06:53,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:53,546 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:53,546 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:53,546 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:53,546 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:53,546 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:53,546 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:53,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:53,546 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2024-11-23 02:06:53,546 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:53,546 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:53,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:53,604 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,605 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-23 02:06:53,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,617 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,618 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-11-23 02:06:53,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-11-23 02:06:53,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,624 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-23 02:06:53,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,636 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,636 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:53,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-23 02:06:53,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,643 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-23 02:06:53,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,655 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,655 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-11-23 02:06:53,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,663 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-23 02:06:53,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,675 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,675 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-11-23 02:06:53,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-11-23 02:06:53,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,681 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-23 02:06:53,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,693 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,693 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-11-23 02:06:53,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,700 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-23 02:06:53,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,711 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,712 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-11-23 02:06:53,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-11-23 02:06:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,718 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-23 02:06:53,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,730 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,730 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=4} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:53,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-11-23 02:06:53,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,736 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-23 02:06:53,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,754 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,755 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=4} Honda state: {ULTIMATE.start_main_~x~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:06:53,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,762 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-23 02:06:53,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,774 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:53,774 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-11-23 02:06:53,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,781 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-11-23 02:06:53,781 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-11-23 02:06:53,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:53,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,798 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-11-23 02:06:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,799 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-11-23 02:06:53,800 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-11-23 02:06:53,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:53,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:53,812 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:53,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,818 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:53,818 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:53,818 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:53,818 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:53,818 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:53,818 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,818 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:53,818 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:53,818 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2024-11-23 02:06:53,818 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:53,818 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:53,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:53,878 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:53,878 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,879 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-11-23 02:06:53,880 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-11-23 02:06:53,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:53,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:53,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:53,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:53,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:53,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:53,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:53,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:53,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:53,898 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-11-23 02:06:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,900 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-11-23 02:06:53,900 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-11-23 02:06:53,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:53,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:53,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:53,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:53,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:53,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:53,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:53,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:53,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:53,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,919 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-11-23 02:06:53,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:53,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:53,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:53,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:53,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:53,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:53,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:53,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:53,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:53,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-11-23 02:06:53,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,939 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-23 02:06:53,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:53,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:53,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:53,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:53,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:53,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:53,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:53,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:53,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:53,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,959 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:53,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-11-23 02:06:53,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:53,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:53,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:53,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:53,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:53,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:53,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:53,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:53,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:53,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:53,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:53,982 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-11-23 02:06:53,982 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-11-23 02:06:53,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:53,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:53,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:53,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:53,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:53,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:53,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:53,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:53,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:54,001 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-11-23 02:06:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:54,004 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-11-23 02:06:54,005 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-11-23 02:06:54,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:54,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:54,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:54,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:54,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:54,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:54,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:54,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:54,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:54,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-11-23 02:06:54,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:54,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:54,024 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-11-23 02:06:54,024 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-11-23 02:06:54,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:54,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:54,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:54,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:54,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:54,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:54,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:54,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:54,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:54,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:54,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:54,043 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-11-23 02:06:54,044 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-11-23 02:06:54,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:54,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:54,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:54,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:54,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:54,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:54,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:54,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:54,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:54,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:54,058 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:06:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:54,059 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-11-23 02:06:54,060 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-11-23 02:06:54,061 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:54,061 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:54,061 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:54,061 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-11-23 02:06:54,066 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-11-23 02:06:54,066 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:54,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:54,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-23 02:06:54,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:54,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-23 02:06:54,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-23 02:06:54,721 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-11-23 02:06:54,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 975 states and 1318 transitions. cyclomatic complexity: 362 Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-23 02:06:54,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 975 states and 1318 transitions. cyclomatic complexity: 362. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 1822 states and 2371 transitions. Complement of second has 73 states. [2024-11-23 02:06:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-23 02:06:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 79 transitions. [2024-11-23 02:06:54,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 79 transitions. Stem has 98 letters. Loop has 68 letters. [2024-11-23 02:06:54,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:54,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 79 transitions. Stem has 166 letters. Loop has 68 letters. [2024-11-23 02:06:54,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:54,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 79 transitions. Stem has 98 letters. Loop has 136 letters. [2024-11-23 02:06:55,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:55,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1822 states and 2371 transitions. [2024-11-23 02:06:55,004 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-11-23 02:06:55,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-23 02:06:55,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1822 states to 1413 states and 1864 transitions. [2024-11-23 02:06:55,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2024-11-23 02:06:55,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2024-11-23 02:06:55,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1413 states and 1864 transitions. [2024-11-23 02:06:55,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:55,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1413 states and 1864 transitions. [2024-11-23 02:06:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states and 1864 transitions. [2024-11-23 02:06:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1227. [2024-11-23 02:06:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 809 states have (on average 1.0704573547589618) internal successors, (866), 798 states have internal predecessors, (866), 242 states have call successors, (260), 134 states have call predecessors, (260), 176 states have return successors, (528), 294 states have call predecessors, (528), 242 states have call successors, (528) [2024-11-23 02:06:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1654 transitions. [2024-11-23 02:06:55,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1227 states and 1654 transitions. [2024-11-23 02:06:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-23 02:06:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-11-23 02:06:55,044 INFO L87 Difference]: Start difference. First operand 1227 states and 1654 transitions. Second operand has 30 states, 24 states have (on average 2.875) internal successors, (69), 28 states have internal predecessors, (69), 16 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (29), 13 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-23 02:06:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:55,672 INFO L93 Difference]: Finished difference Result 1730 states and 2483 transitions. [2024-11-23 02:06:55,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1730 states and 2483 transitions. [2024-11-23 02:06:55,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 137 [2024-11-23 02:06:55,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1730 states to 1707 states and 2450 transitions. [2024-11-23 02:06:55,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2024-11-23 02:06:55,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2024-11-23 02:06:55,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1707 states and 2450 transitions. [2024-11-23 02:06:55,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:55,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1707 states and 2450 transitions. [2024-11-23 02:06:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states and 2450 transitions. [2024-11-23 02:06:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1519. [2024-11-23 02:06:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 978 states have (on average 1.0674846625766872) internal successors, (1044), 966 states have internal predecessors, (1044), 341 states have call successors, (374), 134 states have call predecessors, (374), 200 states have return successors, (774), 418 states have call predecessors, (774), 341 states have call successors, (774) [2024-11-23 02:06:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2192 transitions. [2024-11-23 02:06:55,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1519 states and 2192 transitions. [2024-11-23 02:06:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-23 02:06:55,722 INFO L425 stractBuchiCegarLoop]: Abstraction has 1519 states and 2192 transitions. [2024-11-23 02:06:55,722 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-23 02:06:55,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1519 states and 2192 transitions. [2024-11-23 02:06:55,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2024-11-23 02:06:55,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:55,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:55,727 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-11-23 02:06:55,727 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-11-23 02:06:55,727 INFO L745 eck$LassoCheckResult]: Stem: 43465#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 43404#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; 43405#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; 43429#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; 43416#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43418#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44337#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; 43397#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43398#$Ultimate##0 ~n := #in~n; 44330#L25 assume ~n <= 0;#res := 1; 44328#factFINAL assume true; 44303#factEXIT >#72#return; 43455#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43456#$Ultimate##0 ~n := #in~n; 44348#L25 assume ~n <= 0;#res := 1; 44343#factFINAL assume true; 44341#factEXIT >#74#return; 44342#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44369#$Ultimate##0 ~n := #in~n; 44370#L25 assume ~n <= 0;#res := 1; 44368#factFINAL assume true; 44344#factEXIT >#76#return; 44345#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; 43438#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; 43439#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44449#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44448#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; 44446#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44447#$Ultimate##0 ~n := #in~n; 44541#L25 assume !(~n <= 0); 44537#L26 call #t~ret0 := fact(~n - 1);< 44538#$Ultimate##0 ~n := #in~n; 44545#L25 assume ~n <= 0;#res := 1; 44543#factFINAL assume true; 44542#factEXIT >#70#return; 44450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44453#factFINAL assume true; 44494#factEXIT >#78#return; 44465#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44466#$Ultimate##0 ~n := #in~n; 44477#L25 assume ~n <= 0;#res := 1; 44478#factFINAL assume true; 44463#factEXIT >#80#return; 44451#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44481#$Ultimate##0 ~n := #in~n; 44479#L25 assume !(~n <= 0); 44480#L26 call #t~ret0 := fact(~n - 1);< 44513#$Ultimate##0 ~n := #in~n; 44549#L25 assume ~n <= 0;#res := 1; 44482#factFINAL assume true; 44483#factEXIT >#70#return; 44450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44453#factFINAL assume true; 44494#factEXIT >#82#return; 44495#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; 44440#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; 44415#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43473#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43474#L42-4 havoc main_~k~0#1; 43427#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 43428#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43586#L42-3 [2024-11-23 02:06:55,727 INFO L747 eck$LassoCheckResult]: Loop: 43586#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43585#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; 43573#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43580#$Ultimate##0 ~n := #in~n; 43590#L25 assume !(~n <= 0); 43553#L26 call #t~ret0 := fact(~n - 1);< 43584#$Ultimate##0 ~n := #in~n; 43570#L25 assume ~n <= 0;#res := 1; 43561#factFINAL assume true; 43549#factEXIT >#70#return; 43556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43579#factFINAL assume true; 43572#factEXIT >#72#return; 43577#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43583#$Ultimate##0 ~n := #in~n; 43588#L25 assume ~n <= 0;#res := 1; 43587#factFINAL assume true; 43581#factEXIT >#74#return; 43576#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43578#$Ultimate##0 ~n := #in~n; 43589#L25 assume !(~n <= 0); 43553#L26 call #t~ret0 := fact(~n - 1);< 43584#$Ultimate##0 ~n := #in~n; 43570#L25 assume ~n <= 0;#res := 1; 43561#factFINAL assume true; 43549#factEXIT >#70#return; 43556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43579#factFINAL assume true; 43572#factEXIT >#76#return; 43571#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; 43569#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; 43560#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43548#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43546#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; 43534#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43526#$Ultimate##0 ~n := #in~n; 43606#L25 assume !(~n <= 0); 43552#L26 call #t~ret0 := fact(~n - 1);< 43559#$Ultimate##0 ~n := #in~n; 43570#L25 assume ~n <= 0;#res := 1; 43561#factFINAL assume true; 43549#factEXIT >#70#return; 43547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43545#factFINAL assume true; 43540#factEXIT >#72#return; 43528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43526#$Ultimate##0 ~n := #in~n; 43606#L25 assume !(~n <= 0); 43552#L26 call #t~ret0 := fact(~n - 1);< 43559#$Ultimate##0 ~n := #in~n; 43570#L25 assume ~n <= 0;#res := 1; 43561#factFINAL assume true; 43549#factEXIT >#70#return; 43547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43545#factFINAL assume true; 43540#factEXIT >#74#return; 43533#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43539#$Ultimate##0 ~n := #in~n; 43544#L25 assume ~n <= 0;#res := 1; 43538#factFINAL assume true; 43532#factEXIT >#76#return; 43535#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; 43616#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; 43615#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43614#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43613#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; 43490#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43527#$Ultimate##0 ~n := #in~n; 43600#L25 assume !(~n <= 0); 43554#L26 call #t~ret0 := fact(~n - 1);< 43584#$Ultimate##0 ~n := #in~n; 43696#L25 assume !(~n <= 0); 43643#L26 call #t~ret0 := fact(~n - 1);< 43694#$Ultimate##0 ~n := #in~n; 43697#L25 assume ~n <= 0;#res := 1; 43701#factFINAL assume true; 43700#factEXIT >#70#return; 43699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43693#factFINAL assume true; 43690#factEXIT >#70#return; 43531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43524#factFINAL assume true; 43525#factEXIT >#78#return; 43516#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43526#$Ultimate##0 ~n := #in~n; 43606#L25 assume !(~n <= 0); 43552#L26 call #t~ret0 := fact(~n - 1);< 43559#$Ultimate##0 ~n := #in~n; 43570#L25 assume ~n <= 0;#res := 1; 43561#factFINAL assume true; 43549#factEXIT >#70#return; 43547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43545#factFINAL assume true; 43540#factEXIT >#80#return; 43494#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43523#$Ultimate##0 ~n := #in~n; 43601#L25 assume !(~n <= 0); 43554#L26 call #t~ret0 := fact(~n - 1);< 43584#$Ultimate##0 ~n := #in~n; 43570#L25 assume ~n <= 0;#res := 1; 43561#factFINAL assume true; 43549#factEXIT >#70#return; 43547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43545#factFINAL assume true; 43540#factEXIT >#82#return; 43542#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; 44870#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; 44869#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44868#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43468#L42-4 havoc main_~k~0#1; 43425#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 43426#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43586#L42-3 [2024-11-23 02:06:55,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 3 times [2024-11-23 02:06:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609843280] [2024-11-23 02:06:55,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:55,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-23 02:06:55,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735156364] [2024-11-23 02:06:55,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:55,740 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2024-11-23 02:06:55,803 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-23 02:06:55,803 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:55,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:55,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:55,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1812156592, now seen corresponding path program 8 times [2024-11-23 02:06:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817164415] [2024-11-23 02:06:55,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:55,838 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:55,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231888621] [2024-11-23 02:06:55,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:06:55,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:55,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:55,841 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-11-23 02:06:55,842 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-11-23 02:06:55,932 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:06:55,933 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:55,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:55,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 696833001, now seen corresponding path program 4 times [2024-11-23 02:06:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968690634] [2024-11-23 02:06:55,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:55,985 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:55,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-23 02:06:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968690634] [2024-11-23 02:06:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968690634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200285975] [2024-11-23 02:06:56,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:06:56,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:56,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:56,098 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-11-23 02:06:56,099 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-11-23 02:06:56,194 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:06:56,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:56,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:06:56,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 586 proven. 32 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-11-23 02:06:56,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2024-11-23 02:06:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200285975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:56,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-23 02:06:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445483719] [2024-11-23 02:06:56,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:57,119 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:57,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:57,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:57,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:57,120 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:06:57,120 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,120 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:57,120 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:57,120 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2024-11-23 02:06:57,120 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:57,120 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:57,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,182 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:57,182 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:06:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,184 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:57,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-23 02:06:57,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:57,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,197 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:57,197 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-11-23 02:06:57,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-11-23 02:06:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,203 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:57,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-23 02:06:57,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:57,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,215 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:57,215 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-11-23 02:06:57,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:57,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,222 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:57,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-23 02:06:57,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:57,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,233 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:57,233 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-11-23 02:06:57,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-11-23 02:06:57,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,240 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:57,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-23 02:06:57,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:57,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,253 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:57,253 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-11-23 02:06:57,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:57,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,260 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:06:57,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-11-23 02:06:57,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:57,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,272 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:06:57,272 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-11-23 02:06:57,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:57,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,279 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-11-23 02:06:57,279 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-11-23 02:06:57,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:06:57,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,296 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-11-23 02:06:57,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,297 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-11-23 02:06:57,298 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-11-23 02:06:57,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:06:57,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:06:57,311 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:06:57,316 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-11-23 02:06:57,316 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:06:57,317 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:06:57,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:06:57,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:06:57,317 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:06:57,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:06:57,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:06:57,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2024-11-23 02:06:57,317 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:06:57,317 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:06:57,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:06:57,369 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:06:57,369 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:06:57,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,371 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-11-23 02:06:57,371 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-11-23 02:06:57,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,390 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-11-23 02:06:57,391 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-11-23 02:06:57,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-11-23 02:06:57,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,410 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-11-23 02:06:57,410 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-11-23 02:06:57,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,428 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-11-23 02:06:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,433 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-11-23 02:06:57,434 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-11-23 02:06:57,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,451 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-11-23 02:06:57,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,454 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-11-23 02:06:57,455 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-11-23 02:06:57,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,472 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-11-23 02:06:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,474 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-11-23 02:06:57,474 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-11-23 02:06:57,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,493 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-11-23 02:06:57,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,494 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-11-23 02:06:57,495 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-11-23 02:06:57,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:06:57,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2024-11-23 02:06:57,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,515 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-11-23 02:06:57,515 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-11-23 02:06:57,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:06:57,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:06:57,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:06:57,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:06:57,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:06:57,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:06:57,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:06:57,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:06:57,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:06:57,530 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:06:57,530 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:06:57,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:06:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:57,532 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-11-23 02:06:57,533 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-11-23 02:06:57,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:06:57,534 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:06:57,534 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:06:57,534 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 3 Supporting invariants [] [2024-11-23 02:06:57,540 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-11-23 02:06:57,540 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:06:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:57,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-23 02:06:57,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:57,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-11-23 02:06:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:06:57,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-23 02:06:57,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2024-11-23 02:06:58,148 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2024-11-23 02:06:58,148 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1519 states and 2192 transitions. cyclomatic complexity: 696 Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-23 02:06:58,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1519 states and 2192 transitions. cyclomatic complexity: 696. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Result 3278 states and 4745 transitions. Complement of second has 40 states. [2024-11-23 02:06:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-11-23 02:06:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-23 02:06:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2024-11-23 02:06:58,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 61 letters. Loop has 112 letters. [2024-11-23 02:06:58,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:58,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 173 letters. Loop has 112 letters. [2024-11-23 02:06:58,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:58,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 61 letters. Loop has 224 letters. [2024-11-23 02:06:58,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:06:58,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3278 states and 4745 transitions. [2024-11-23 02:06:58,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 121 [2024-11-23 02:06:58,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3278 states to 1871 states and 2758 transitions. [2024-11-23 02:06:58,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2024-11-23 02:06:58,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 490 [2024-11-23 02:06:58,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1871 states and 2758 transitions. [2024-11-23 02:06:58,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:58,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1871 states and 2758 transitions. [2024-11-23 02:06:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states and 2758 transitions. [2024-11-23 02:06:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1867. [2024-11-23 02:06:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1202 states have (on average 1.076539101497504) internal successors, (1294), 1191 states have internal predecessors, (1294), 431 states have call successors, (464), 158 states have call predecessors, (464), 234 states have return successors, (996), 517 states have call predecessors, (996), 431 states have call successors, (996) [2024-11-23 02:06:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2754 transitions. [2024-11-23 02:06:58,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1867 states and 2754 transitions. [2024-11-23 02:06:58,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:58,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 02:06:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-23 02:06:58,427 INFO L87 Difference]: Start difference. First operand 1867 states and 2754 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 11 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 11 states have call predecessors, (35), 11 states have call successors, (35) [2024-11-23 02:06:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:06:58,838 INFO L93 Difference]: Finished difference Result 2556 states and 3988 transitions. [2024-11-23 02:06:58,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2556 states and 3988 transitions. [2024-11-23 02:06:58,852 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 200 [2024-11-23 02:06:58,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2556 states to 2114 states and 3247 transitions. [2024-11-23 02:06:58,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 627 [2024-11-23 02:06:58,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 633 [2024-11-23 02:06:58,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 3247 transitions. [2024-11-23 02:06:58,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:06:58,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2114 states and 3247 transitions. [2024-11-23 02:06:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 3247 transitions. [2024-11-23 02:06:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1900. [2024-11-23 02:06:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1222 states have (on average 1.0679214402618658) internal successors, (1305), 1212 states have internal predecessors, (1305), 444 states have call successors, (477), 158 states have call predecessors, (477), 234 states have return successors, (1038), 529 states have call predecessors, (1038), 444 states have call successors, (1038) [2024-11-23 02:06:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2820 transitions. [2024-11-23 02:06:58,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1900 states and 2820 transitions. [2024-11-23 02:06:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-23 02:06:58,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 1900 states and 2820 transitions. [2024-11-23 02:06:58,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-23 02:06:58,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1900 states and 2820 transitions. [2024-11-23 02:06:58,927 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 146 [2024-11-23 02:06:58,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:06:58,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:06:58,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:06:58,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [40, 40, 25, 25, 25, 25, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-23 02:06:58,930 INFO L745 eck$LassoCheckResult]: Stem: 54363#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 54311#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; 54312#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; 54333#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; 54364#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54857#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54856#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; 54309#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54310#$Ultimate##0 ~n := #in~n; 54805#L25 assume ~n <= 0;#res := 1; 54804#factFINAL assume true; 54803#factEXIT >#72#return; 54354#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54355#$Ultimate##0 ~n := #in~n; 54925#L25 assume ~n <= 0;#res := 1; 54923#factFINAL assume true; 54921#factEXIT >#74#return; 54300#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54301#$Ultimate##0 ~n := #in~n; 54927#L25 assume ~n <= 0;#res := 1; 54926#factFINAL assume true; 54924#factEXIT >#76#return; 54922#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; 54344#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; 54345#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 55787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55786#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; 55768#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55776#$Ultimate##0 ~n := #in~n; 55806#L25 assume !(~n <= 0); 55793#L26 call #t~ret0 := fact(~n - 1);< 55795#$Ultimate##0 ~n := #in~n; 55885#L25 assume ~n <= 0;#res := 1; 55884#factFINAL assume true; 55883#factEXIT >#70#return; 55780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55775#factFINAL assume true; 55767#factEXIT >#78#return; 55771#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55779#$Ultimate##0 ~n := #in~n; 55785#L25 assume ~n <= 0;#res := 1; 55784#factFINAL assume true; 55777#factEXIT >#80#return; 55769#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55773#$Ultimate##0 ~n := #in~n; 55882#L25 assume !(~n <= 0); 55782#L26 call #t~ret0 := fact(~n - 1);< 55783#$Ultimate##0 ~n := #in~n; 55804#L25 assume ~n <= 0;#res := 1; 55886#factFINAL assume true; 55781#factEXIT >#70#return; 55780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55775#factFINAL assume true; 55767#factEXIT >#82#return; 55764#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; 55761#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; 55759#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 55754#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55744#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; 55723#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55729#$Ultimate##0 ~n := #in~n; 55819#L25 assume !(~n <= 0); 55746#L26 call #t~ret0 := fact(~n - 1);< 55753#$Ultimate##0 ~n := #in~n; 55766#L25 assume !(~n <= 0); 55748#L26 call #t~ret0 := fact(~n - 1);< 55763#$Ultimate##0 ~n := #in~n; 55774#L25 assume ~n <= 0;#res := 1; 55765#factFINAL assume true; 55762#factEXIT >#70#return; 55760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55755#factFINAL assume true; 55745#factEXIT >#70#return; 55743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55741#factFINAL assume true; 55720#factEXIT >#78#return; 55711#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55714#$Ultimate##0 ~n := #in~n; 55739#L25 assume ~n <= 0;#res := 1; 55718#factFINAL assume true; 55709#factEXIT >#80#return; 55702#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55707#$Ultimate##0 ~n := #in~n; 55740#L25 assume !(~n <= 0); 55732#L26 call #t~ret0 := fact(~n - 1);< 55738#$Ultimate##0 ~n := #in~n; 55810#L25 assume !(~n <= 0); 55731#L26 call #t~ret0 := fact(~n - 1);< 55799#$Ultimate##0 ~n := #in~n; 55809#L25 assume ~n <= 0;#res := 1; 55808#factFINAL assume true; 55798#factEXIT >#70#return; 55796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55791#factFINAL assume true; 55730#factEXIT >#70#return; 55717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55708#factFINAL assume true; 55701#factEXIT >#82#return; 55700#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; 55699#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; 55698#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54720#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 54666#L42-4 havoc main_~k~0#1; 54719#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 54717#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54718#L42-3 [2024-11-23 02:06:58,931 INFO L747 eck$LassoCheckResult]: Loop: 54718#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55056#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; 55044#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55052#$Ultimate##0 ~n := #in~n; 55055#L25 assume !(~n <= 0); 55006#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55060#factFINAL assume true; 55054#factEXIT >#72#return; 55042#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55052#$Ultimate##0 ~n := #in~n; 55055#L25 assume ~n <= 0;#res := 1; 55053#factFINAL assume true; 55050#factEXIT >#74#return; 55047#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55049#$Ultimate##0 ~n := #in~n; 55071#L25 assume !(~n <= 0); 55006#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55016#L25 assume ~n <= 0;#res := 1; 55013#factFINAL assume true; 54998#factEXIT >#70#return; 55011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55057#factFINAL assume true; 55041#factEXIT >#76#return; 54971#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; 55040#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; 55039#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 55038#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55037#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; 54935#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55035#$Ultimate##0 ~n := #in~n; 55100#L25 assume !(~n <= 0); 55064#L26 call #t~ret0 := fact(~n - 1);< 55098#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55080#factFINAL assume true; 55081#factEXIT >#70#return; 55235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56145#factFINAL assume true; 56114#factEXIT >#72#return; 54964#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55016#L25 assume ~n <= 0;#res := 1; 55013#factFINAL assume true; 54998#factEXIT >#70#return; 54997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54996#factFINAL assume true; 54992#factEXIT >#74#return; 54951#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54979#$Ultimate##0 ~n := #in~n; 55026#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55016#L25 assume ~n <= 0;#res := 1; 55013#factFINAL assume true; 54998#factEXIT >#70#return; 54997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54996#factFINAL assume true; 54992#factEXIT >#76#return; 54993#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; 55031#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; 55029#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 55028#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55027#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; 54950#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55080#factFINAL assume true; 55081#factEXIT >#70#return; 55235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56145#factFINAL assume true; 56114#factEXIT >#72#return; 54931#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55080#factFINAL assume true; 55081#factEXIT >#70#return; 55235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56145#factFINAL assume true; 56114#factEXIT >#74#return; 54966#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume ~n <= 0;#res := 1; 54987#factFINAL assume true; 54983#factEXIT >#76#return; 54984#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; 55023#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; 55021#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 55019#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55017#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; 54958#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55080#factFINAL assume true; 55081#factEXIT >#70#return; 55235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56145#factFINAL assume true; 56114#factEXIT >#78#return; 54932#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55016#L25 assume ~n <= 0;#res := 1; 55013#factFINAL assume true; 54998#factEXIT >#70#return; 54997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54996#factFINAL assume true; 54992#factEXIT >#80#return; 54957#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54979#$Ultimate##0 ~n := #in~n; 55026#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55016#L25 assume ~n <= 0;#res := 1; 55013#factFINAL assume true; 54998#factEXIT >#70#return; 54997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54996#factFINAL assume true; 54992#factEXIT >#82#return; 54994#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; 55079#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; 55075#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 55076#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55173#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; 54961#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55080#factFINAL assume true; 55081#factEXIT >#70#return; 55235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56145#factFINAL assume true; 56114#factEXIT >#78#return; 54969#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54988#$Ultimate##0 ~n := #in~n; 54989#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55016#L25 assume ~n <= 0;#res := 1; 55013#factFINAL assume true; 54998#factEXIT >#70#return; 54997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54996#factFINAL assume true; 54992#factEXIT >#80#return; 54945#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54979#$Ultimate##0 ~n := #in~n; 55026#L25 assume !(~n <= 0); 54990#L26 call #t~ret0 := fact(~n - 1);< 55015#$Ultimate##0 ~n := #in~n; 55099#L25 assume !(~n <= 0); 55063#L26 call #t~ret0 := fact(~n - 1);< 55097#$Ultimate##0 ~n := #in~n; 55101#L25 assume ~n <= 0;#res := 1; 55208#factFINAL assume true; 55207#factEXIT >#70#return; 55206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55205#factFINAL assume true; 55197#factEXIT >#70#return; 55199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56144#factFINAL assume true; 56115#factEXIT >#82#return; 56117#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; 56135#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; 56134#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 56133#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 55070#L42-4 havoc main_~k~0#1; 55069#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 55058#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54718#L42-3 [2024-11-23 02:06:58,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash 157168703, now seen corresponding path program 5 times [2024-11-23 02:06:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:58,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585429795] [2024-11-23 02:06:58,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:58,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:58,945 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-23 02:06:58,946 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:06:58,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902989623] [2024-11-23 02:06:58,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:06:58,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:58,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:58,949 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:58,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2024-11-23 02:06:59,034 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-23 02:06:59,034 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:06:59,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:06:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:06:59,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:06:59,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:06:59,074 INFO L85 PathProgramCache]: Analyzing trace with hash -890877282, now seen corresponding path program 9 times [2024-11-23 02:06:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:06:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266861963] [2024-11-23 02:06:59,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:06:59,123 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-23 02:06:59,123 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 407 proven. 220 refuted. 0 times theorem prover too weak. 3148 trivial. 0 not checked. [2024-11-23 02:06:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:06:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266861963] [2024-11-23 02:06:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266861963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:06:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524704326] [2024-11-23 02:06:59,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:06:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:06:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:06:59,270 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:06:59,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2024-11-23 02:06:59,382 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-23 02:06:59,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:06:59,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:06:59,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:06:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 941 proven. 173 refuted. 0 times theorem prover too weak. 2661 trivial. 0 not checked. [2024-11-23 02:06:59,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:06:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 405 proven. 223 refuted. 0 times theorem prover too weak. 3147 trivial. 0 not checked. [2024-11-23 02:06:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524704326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:06:59,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:06:59,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 19 [2024-11-23 02:06:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381516836] [2024-11-23 02:06:59,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:06:59,765 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:06:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:06:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 02:06:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-23 02:06:59,766 INFO L87 Difference]: Start difference. First operand 1900 states and 2820 transitions. cyclomatic complexity: 947 Second operand has 19 states, 14 states have (on average 4.071428571428571) internal successors, (57), 19 states have internal predecessors, (57), 14 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (25), 8 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-23 02:07:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:00,105 INFO L93 Difference]: Finished difference Result 1893 states and 2742 transitions. [2024-11-23 02:07:00,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1893 states and 2742 transitions. [2024-11-23 02:07:00,113 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 124 [2024-11-23 02:07:00,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1893 states to 1643 states and 2296 transitions. [2024-11-23 02:07:00,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 513 [2024-11-23 02:07:00,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2024-11-23 02:07:00,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1643 states and 2296 transitions. [2024-11-23 02:07:00,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:00,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1643 states and 2296 transitions. [2024-11-23 02:07:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states and 2296 transitions. [2024-11-23 02:07:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1628. [2024-11-23 02:07:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1051 states have (on average 1.060894386298763) internal successors, (1115), 1046 states have internal predecessors, (1115), 356 states have call successors, (389), 146 states have call predecessors, (389), 221 states have return successors, (766), 435 states have call predecessors, (766), 356 states have call successors, (766) [2024-11-23 02:07:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2270 transitions. [2024-11-23 02:07:00,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1628 states and 2270 transitions. [2024-11-23 02:07:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 02:07:00,160 INFO L425 stractBuchiCegarLoop]: Abstraction has 1628 states and 2270 transitions. [2024-11-23 02:07:00,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-23 02:07:00,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1628 states and 2270 transitions. [2024-11-23 02:07:00,163 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 114 [2024-11-23 02:07:00,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:00,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:00,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [18, 18, 10, 8, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:00,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [52, 52, 37, 37, 37, 37, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-23 02:07:00,167 INFO L745 eck$LassoCheckResult]: Stem: 59724#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 59662#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; 59663#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; 59686#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; 59725#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60002#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60001#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; 59649#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 59650#$Ultimate##0 ~n := #in~n; 59994#L25 assume ~n <= 0;#res := 1; 59991#factFINAL assume true; 59987#factEXIT >#72#return; 59712#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 59713#$Ultimate##0 ~n := #in~n; 60059#L25 assume ~n <= 0;#res := 1; 60058#factFINAL assume true; 60057#factEXIT >#74#return; 59645#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59646#$Ultimate##0 ~n := #in~n; 60051#L25 assume ~n <= 0;#res := 1; 60050#factFINAL assume true; 60048#factEXIT >#76#return; 59680#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; 59681#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; 59697#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60885#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60881#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; 60873#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60880#$Ultimate##0 ~n := #in~n; 60904#L25 assume !(~n <= 0); 60892#L26 call #t~ret0 := fact(~n - 1);< 60901#$Ultimate##0 ~n := #in~n; 60912#L25 assume ~n <= 0;#res := 1; 60915#factFINAL assume true; 60891#factEXIT >#70#return; 60888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60879#factFINAL assume true; 60870#factEXIT >#78#return; 60875#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60884#$Ultimate##0 ~n := #in~n; 60890#L25 assume ~n <= 0;#res := 1; 60889#factFINAL assume true; 60882#factEXIT >#80#return; 60871#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60876#$Ultimate##0 ~n := #in~n; 60903#L25 assume !(~n <= 0); 60893#L26 call #t~ret0 := fact(~n - 1);< 60894#$Ultimate##0 ~n := #in~n; 60914#L25 assume ~n <= 0;#res := 1; 60913#factFINAL assume true; 60911#factEXIT >#70#return; 60888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60879#factFINAL assume true; 60870#factEXIT >#82#return; 60868#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; 60866#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; 60864#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60854#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60852#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; 60833#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60839#$Ultimate##0 ~n := #in~n; 61029#L25 assume !(~n <= 0); 60856#L26 call #t~ret0 := fact(~n - 1);< 60863#$Ultimate##0 ~n := #in~n; 60924#L25 assume !(~n <= 0); 60858#L26 call #t~ret0 := fact(~n - 1);< 60922#$Ultimate##0 ~n := #in~n; 60925#L25 assume ~n <= 0;#res := 1; 60923#factFINAL assume true; 60921#factEXIT >#70#return; 60920#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60917#factFINAL assume true; 60855#factEXIT >#70#return; 60853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60850#factFINAL assume true; 60831#factEXIT >#78#return; 60824#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60825#$Ultimate##0 ~n := #in~n; 60849#L25 assume ~n <= 0;#res := 1; 60829#factFINAL assume true; 60820#factEXIT >#80#return; 60815#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60818#$Ultimate##0 ~n := #in~n; 60916#L25 assume !(~n <= 0); 60843#L26 call #t~ret0 := fact(~n - 1);< 60848#$Ultimate##0 ~n := #in~n; 60887#L25 assume !(~n <= 0); 60842#L26 call #t~ret0 := fact(~n - 1);< 60878#$Ultimate##0 ~n := #in~n; 60898#L25 assume ~n <= 0;#res := 1; 60886#factFINAL assume true; 60877#factEXIT >#70#return; 60869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60867#factFINAL assume true; 60840#factEXIT >#70#return; 60828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60819#factFINAL assume true; 60813#factEXIT >#82#return; 60812#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; 60811#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; 60810#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59882#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 59731#L42-4 havoc main_~k~0#1; 59732#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 59881#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 59677#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60201#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; 60174#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60182#$Ultimate##0 ~n := #in~n; 60200#L25 assume !(~n <= 0); 60124#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60187#factFINAL assume true; 60183#factEXIT >#72#return; 60172#L30-1 [2024-11-23 02:07:00,168 INFO L747 eck$LassoCheckResult]: Loop: 60172#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60182#$Ultimate##0 ~n := #in~n; 60200#L25 assume ~n <= 0;#res := 1; 60199#factFINAL assume true; 60180#factEXIT >#74#return; 60177#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60179#$Ultimate##0 ~n := #in~n; 60208#L25 assume !(~n <= 0); 60124#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60187#factFINAL assume true; 60183#factEXIT >#76#return; 60093#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; 60218#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; 60217#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60216#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60215#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; 60107#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60116#$Ultimate##0 ~n := #in~n; 60221#L25 assume !(~n <= 0); 60191#L26 call #t~ret0 := fact(~n - 1);< 60197#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#72#return; 60081#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60117#$Ultimate##0 ~n := #in~n; 60150#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60142#L25 assume ~n <= 0;#res := 1; 60138#factFINAL assume true; 60123#factEXIT >#70#return; 60122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60121#factFINAL assume true; 60066#factEXIT >#74#return; 60070#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60094#$Ultimate##0 ~n := #in~n; 60140#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60142#L25 assume ~n <= 0;#res := 1; 60138#factFINAL assume true; 60123#factEXIT >#70#return; 60122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60121#factFINAL assume true; 60066#factEXIT >#76#return; 60091#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; 60158#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; 60156#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60154#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60152#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; 60112#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60116#$Ultimate##0 ~n := #in~n; 60221#L25 assume !(~n <= 0); 60191#L26 call #t~ret0 := fact(~n - 1);< 60197#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#72#return; 60075#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60117#$Ultimate##0 ~n := #in~n; 60150#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#74#return; 60073#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60117#$Ultimate##0 ~n := #in~n; 60150#L25 assume ~n <= 0;#res := 1; 60149#factFINAL assume true; 60148#factEXIT >#76#return; 60147#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; 60146#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; 60145#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60143#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60141#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; 60077#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60117#$Ultimate##0 ~n := #in~n; 60150#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#78#return; 60109#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60116#$Ultimate##0 ~n := #in~n; 60221#L25 assume !(~n <= 0); 60191#L26 call #t~ret0 := fact(~n - 1);< 60197#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#80#return; 60069#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60094#$Ultimate##0 ~n := #in~n; 60140#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60142#L25 assume ~n <= 0;#res := 1; 60138#factFINAL assume true; 60123#factEXIT >#70#return; 60122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60121#factFINAL assume true; 60066#factEXIT >#82#return; 60090#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; 60214#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; 60213#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 60210#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60211#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; 60087#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60117#$Ultimate##0 ~n := #in~n; 60150#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#78#return; 60113#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60116#$Ultimate##0 ~n := #in~n; 60221#L25 assume !(~n <= 0); 60191#L26 call #t~ret0 := fact(~n - 1);< 60197#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60222#factFINAL assume true; 60223#factEXIT >#70#return; 60194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60373#factFINAL assume true; 60189#factEXIT >#70#return; 60193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60104#factFINAL assume true; 60115#factEXIT >#80#return; 60083#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60094#$Ultimate##0 ~n := #in~n; 60140#L25 assume !(~n <= 0); 60126#L26 call #t~ret0 := fact(~n - 1);< 60137#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61235#factFINAL assume true; 61214#factEXIT >#82#return; 60063#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; 60060#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; 60056#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59733#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 59734#L42-4 havoc main_~k~0#1; 59682#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 59683#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60203#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; 60185#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60186#$Ultimate##0 ~n := #in~n; 60212#L25 assume !(~n <= 0); 60190#L26 call #t~ret0 := fact(~n - 1);< 60197#$Ultimate##0 ~n := #in~n; 60240#L25 assume !(~n <= 0); 60192#L26 call #t~ret0 := fact(~n - 1);< 60224#$Ultimate##0 ~n := #in~n; 60246#L25 assume ~n <= 0;#res := 1; 60341#factFINAL assume true; 60338#factEXIT >#70#return; 60337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60335#factFINAL assume true; 60331#factEXIT >#70#return; 60188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60187#factFINAL assume true; 60183#factEXIT >#72#return; 60172#L30-1 [2024-11-23 02:07:00,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash -908725591, now seen corresponding path program 6 times [2024-11-23 02:07:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852831135] [2024-11-23 02:07:00,168 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:00,176 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-23 02:07:00,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 12 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-23 02:07:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:00,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852831135] [2024-11-23 02:07:00,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852831135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005541364] [2024-11-23 02:07:00,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:00,227 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:00,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2024-11-23 02:07:00,313 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-23 02:07:00,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:00,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 02:07:00,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 12 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-23 02:07:00,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 13 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2024-11-23 02:07:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005541364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:00,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9 [2024-11-23 02:07:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289549657] [2024-11-23 02:07:00,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:00,488 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:00,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash -764731068, now seen corresponding path program 10 times [2024-11-23 02:07:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587970786] [2024-11-23 02:07:00,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:00,512 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:00,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6691 backedges. 183 proven. 1177 refuted. 0 times theorem prover too weak. 5331 trivial. 0 not checked. [2024-11-23 02:07:00,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:00,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587970786] [2024-11-23 02:07:00,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587970786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:00,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92227560] [2024-11-23 02:07:00,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:00,853 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:00,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2024-11-23 02:07:00,989 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:00,990 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:00,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-23 02:07:00,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6691 backedges. 2677 proven. 77 refuted. 0 times theorem prover too weak. 3937 trivial. 0 not checked. [2024-11-23 02:07:01,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6691 backedges. 184 proven. 1372 refuted. 0 times theorem prover too weak. 5135 trivial. 0 not checked. [2024-11-23 02:07:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92227560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:01,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:01,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 25 [2024-11-23 02:07:01,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471405279] [2024-11-23 02:07:01,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:01,745 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 02:07:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-23 02:07:01,746 INFO L87 Difference]: Start difference. First operand 1628 states and 2270 transitions. cyclomatic complexity: 669 Second operand has 10 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-23 02:07:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:01,880 INFO L93 Difference]: Finished difference Result 1920 states and 2760 transitions. [2024-11-23 02:07:01,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1920 states and 2760 transitions. [2024-11-23 02:07:01,888 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 130 [2024-11-23 02:07:01,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1920 states to 1920 states and 2760 transitions. [2024-11-23 02:07:01,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 620 [2024-11-23 02:07:01,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 620 [2024-11-23 02:07:01,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1920 states and 2760 transitions. [2024-11-23 02:07:01,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:01,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1920 states and 2760 transitions. [2024-11-23 02:07:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states and 2760 transitions. [2024-11-23 02:07:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1634. [2024-11-23 02:07:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1056 states have (on average 1.0625) internal successors, (1122), 1052 states have internal predecessors, (1122), 357 states have call successors, (390), 146 states have call predecessors, (390), 221 states have return successors, (768), 435 states have call predecessors, (768), 357 states have call successors, (768) [2024-11-23 02:07:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2280 transitions. [2024-11-23 02:07:01,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1634 states and 2280 transitions. [2024-11-23 02:07:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 02:07:01,931 INFO L425 stractBuchiCegarLoop]: Abstraction has 1634 states and 2280 transitions. [2024-11-23 02:07:01,931 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-23 02:07:01,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1634 states and 2280 transitions. [2024-11-23 02:07:01,935 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 114 [2024-11-23 02:07:01,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:01,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:01,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 12, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:01,936 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-11-23 02:07:01,936 INFO L745 eck$LassoCheckResult]: Stem: 66005#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 65948#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; 65949#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; 65973#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; 65960#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 65962#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66226#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; 65944#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65945#$Ultimate##0 ~n := #in~n; 66470#L25 assume ~n <= 0;#res := 1; 66432#factFINAL assume true; 66416#factEXIT >#72#return; 65994#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65995#$Ultimate##0 ~n := #in~n; 66558#L25 assume ~n <= 0;#res := 1; 66557#factFINAL assume true; 66554#factEXIT >#74#return; 66555#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66575#$Ultimate##0 ~n := #in~n; 66577#L25 assume ~n <= 0;#res := 1; 66576#factFINAL assume true; 66574#factEXIT >#76#return; 66573#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; 66571#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; 66572#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 66650#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66649#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; 66647#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66648#$Ultimate##0 ~n := #in~n; 66783#L25 assume !(~n <= 0); 66760#L26 call #t~ret0 := fact(~n - 1);< 66765#$Ultimate##0 ~n := #in~n; 66766#L25 assume ~n <= 0;#res := 1; 66759#factFINAL assume true; 66761#factEXIT >#70#return; 66731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66728#factFINAL assume true; 66724#factEXIT >#78#return; 66641#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66642#$Ultimate##0 ~n := #in~n; 66644#L25 assume ~n <= 0;#res := 1; 66643#factFINAL assume true; 66639#factEXIT >#80#return; 65956#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66006#$Ultimate##0 ~n := #in~n; 66627#L25 assume !(~n <= 0); 65954#L26 call #t~ret0 := fact(~n - 1);< 65957#$Ultimate##0 ~n := #in~n; 66763#L25 assume ~n <= 0;#res := 1; 66764#factFINAL assume true; 66742#factEXIT >#70#return; 66731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66728#factFINAL assume true; 66724#factEXIT >#82#return; 66725#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; 66959#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; 66958#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 66957#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66956#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; 66708#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66714#$Ultimate##0 ~n := #in~n; 66927#L25 assume !(~n <= 0); 66737#L26 call #t~ret0 := fact(~n - 1);< 66741#$Ultimate##0 ~n := #in~n; 66757#L25 assume !(~n <= 0); 66734#L26 call #t~ret0 := fact(~n - 1);< 66755#$Ultimate##0 ~n := #in~n; 66758#L25 assume ~n <= 0;#res := 1; 66756#factFINAL assume true; 66754#factEXIT >#70#return; 66751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66745#factFINAL assume true; 66733#factEXIT >#70#return; 66730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66718#factFINAL assume true; 66704#factEXIT >#78#return; 66713#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66696#$Ultimate##0 ~n := #in~n; 66955#L25 assume ~n <= 0;#res := 1; 66951#factFINAL assume true; 66949#factEXIT >#80#return; 66933#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66931#$Ultimate##0 ~n := #in~n; 66936#L25 assume !(~n <= 0); 66887#L26 call #t~ret0 := fact(~n - 1);< 66893#$Ultimate##0 ~n := #in~n; 66965#L25 assume !(~n <= 0); 66886#L26 call #t~ret0 := fact(~n - 1);< 66914#$Ultimate##0 ~n := #in~n; 66964#L25 assume ~n <= 0;#res := 1; 66963#factFINAL assume true; 66962#factEXIT >#70#return; 66961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66960#factFINAL assume true; 66952#factEXIT >#70#return; 66950#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66948#factFINAL assume true; 66946#factEXIT >#82#return; 66945#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; 66944#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; 66943#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 66941#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66939#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; 66871#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66877#$Ultimate##0 ~n := #in~n; 66938#L25 assume !(~n <= 0); 66888#L26 call #t~ret0 := fact(~n - 1);< 66893#$Ultimate##0 ~n := #in~n; 66965#L25 assume !(~n <= 0); 66886#L26 call #t~ret0 := fact(~n - 1);< 66914#$Ultimate##0 ~n := #in~n; 66965#L25 assume !(~n <= 0); 66886#L26 call #t~ret0 := fact(~n - 1);< 66914#$Ultimate##0 ~n := #in~n; 66964#L25 assume ~n <= 0;#res := 1; 66963#factFINAL assume true; 66962#factEXIT >#70#return; 66961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66960#factFINAL assume true; 66952#factEXIT >#70#return; 66953#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66982#factFINAL assume true; 66885#factEXIT >#70#return; 66880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66878#factFINAL assume true; 66870#factEXIT >#78#return; 66771#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66773#$Ultimate##0 ~n := #in~n; 66779#L25 assume ~n <= 0;#res := 1; 66777#factFINAL assume true; 66770#factEXIT >#80#return; 66681#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66683#$Ultimate##0 ~n := #in~n; 66703#L25 assume !(~n <= 0); 66660#L26 call #t~ret0 := fact(~n - 1);< 66665#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66673#L25 assume ~n <= 0;#res := 1; 66744#factFINAL assume true; 66743#factEXIT >#70#return; 66732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66729#factFINAL assume true; 66699#factEXIT >#70#return; 66687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66684#factFINAL assume true; 66679#factEXIT >#82#return; 66583#L30-8 [2024-11-23 02:07:01,936 INFO L747 eck$LassoCheckResult]: Loop: 66583#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; 66676#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; 66674#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 66672#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66670#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; 66580#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65913#$Ultimate##0 ~n := #in~n; 66677#L25 assume !(~n <= 0); 66661#L26 call #t~ret0 := fact(~n - 1);< 66665#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66673#L25 assume ~n <= 0;#res := 1; 66744#factFINAL assume true; 66743#factEXIT >#70#return; 66732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66729#factFINAL assume true; 66699#factEXIT >#70#return; 66700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66726#factFINAL assume true; 66721#factEXIT >#70#return; 66697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66688#factFINAL assume true; 66685#factEXIT >#70#return; 66662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66667#factFINAL assume true; 66657#factEXIT >#70#return; 66655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66653#factFINAL assume true; 66651#factEXIT >#78#return; 66652#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66002#$Ultimate##0 ~n := #in~n; 66678#L25 assume ~n <= 0;#res := 1; 66666#factFINAL assume true; 66656#factEXIT >#80#return; 66582#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66654#$Ultimate##0 ~n := #in~n; 66675#L25 assume !(~n <= 0); 66661#L26 call #t~ret0 := fact(~n - 1);< 66665#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66671#L25 assume !(~n <= 0); 66658#L26 call #t~ret0 := fact(~n - 1);< 66668#$Ultimate##0 ~n := #in~n; 66673#L25 assume ~n <= 0;#res := 1; 66744#factFINAL assume true; 66743#factEXIT >#70#return; 66732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66729#factFINAL assume true; 66699#factEXIT >#70#return; 66700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66726#factFINAL assume true; 66721#factEXIT >#70#return; 66697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66688#factFINAL assume true; 66685#factEXIT >#70#return; 66686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66822#factFINAL assume true; 66579#factEXIT >#82#return; 66583#L30-8 [2024-11-23 02:07:01,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1182061097, now seen corresponding path program 6 times [2024-11-23 02:07:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:01,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353992628] [2024-11-23 02:07:01,937 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:01,964 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-23 02:07:01,964 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 238 proven. 13 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2024-11-23 02:07:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353992628] [2024-11-23 02:07:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353992628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136592628] [2024-11-23 02:07:02,107 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:02,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:02,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:02,109 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:02,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2024-11-23 02:07:02,321 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-23 02:07:02,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:02,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 02:07:02,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 236 proven. 13 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2024-11-23 02:07:02,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 236 proven. 17 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-11-23 02:07:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136592628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:02,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 20 [2024-11-23 02:07:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259500261] [2024-11-23 02:07:02,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:02,739 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1935422908, now seen corresponding path program 5 times [2024-11-23 02:07:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106735522] [2024-11-23 02:07:02,740 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:02,748 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-23 02:07:02,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 63 proven. 173 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-23 02:07:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106735522] [2024-11-23 02:07:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106735522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263059493] [2024-11-23 02:07:02,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:02,904 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:02,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2024-11-23 02:07:02,974 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-23 02:07:02,974 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:02,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 02:07:02,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 58 proven. 173 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-23 02:07:03,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 58 proven. 209 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-23 02:07:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263059493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:03,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 27 [2024-11-23 02:07:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277476511] [2024-11-23 02:07:03,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:03,963 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-23 02:07:03,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-23 02:07:03,965 INFO L87 Difference]: Start difference. First operand 1634 states and 2280 transitions. cyclomatic complexity: 673 Second operand has 28 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 15 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-23 02:07:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:04,610 INFO L93 Difference]: Finished difference Result 2162 states and 3200 transitions. [2024-11-23 02:07:04,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2162 states and 3200 transitions. [2024-11-23 02:07:04,619 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 196 [2024-11-23 02:07:04,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2162 states to 2055 states and 3063 transitions. [2024-11-23 02:07:04,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 638 [2024-11-23 02:07:04,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 638 [2024-11-23 02:07:04,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2055 states and 3063 transitions. [2024-11-23 02:07:04,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:04,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2055 states and 3063 transitions. [2024-11-23 02:07:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states and 3063 transitions. [2024-11-23 02:07:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1760. [2024-11-23 02:07:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1126 states have (on average 1.0577264653641207) internal successors, (1191), 1126 states have internal predecessors, (1191), 414 states have call successors, (446), 189 states have call predecessors, (446), 220 states have return successors, (934), 444 states have call predecessors, (934), 414 states have call successors, (934) [2024-11-23 02:07:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2571 transitions. [2024-11-23 02:07:04,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1760 states and 2571 transitions. [2024-11-23 02:07:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-23 02:07:04,669 INFO L425 stractBuchiCegarLoop]: Abstraction has 1760 states and 2571 transitions. [2024-11-23 02:07:04,669 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-23 02:07:04,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1760 states and 2571 transitions. [2024-11-23 02:07:04,673 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 128 [2024-11-23 02:07:04,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:04,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:04,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 12, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:04,674 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-11-23 02:07:04,674 INFO L745 eck$LassoCheckResult]: Stem: 71200#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 71146#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; 71147#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; 71169#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; 71201#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 71189#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71173#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; 71142#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71143#$Ultimate##0 ~n := #in~n; 72545#L25 assume ~n <= 0;#res := 1; 72544#factFINAL assume true; 72542#factEXIT >#72#return; 71191#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71192#$Ultimate##0 ~n := #in~n; 72547#L25 assume ~n <= 0;#res := 1; 72546#factFINAL assume true; 72541#factEXIT >#74#return; 71132#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71133#$Ultimate##0 ~n := #in~n; 72431#L25 assume ~n <= 0;#res := 1; 72430#factFINAL assume true; 72428#factEXIT >#76#return; 72429#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; 72537#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; 72536#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 72535#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72534#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; 71116#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71117#$Ultimate##0 ~n := #in~n; 72478#L25 assume !(~n <= 0); 72479#L26 call #t~ret0 := fact(~n - 1);< 72637#$Ultimate##0 ~n := #in~n; 72482#L25 assume ~n <= 0;#res := 1; 72483#factFINAL assume true; 72638#factEXIT >#70#return; 72476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72460#factFINAL assume true; 72463#factEXIT >#78#return; 72467#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72468#$Ultimate##0 ~n := #in~n; 72471#L25 assume ~n <= 0;#res := 1; 72470#factFINAL assume true; 72466#factEXIT >#80#return; 72462#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72464#$Ultimate##0 ~n := #in~n; 72480#L25 assume !(~n <= 0); 72475#L26 call #t~ret0 := fact(~n - 1);< 72477#$Ultimate##0 ~n := #in~n; 72489#L25 assume ~n <= 0;#res := 1; 72481#factFINAL assume true; 72474#factEXIT >#70#return; 72476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72460#factFINAL assume true; 72463#factEXIT >#82#return; 72635#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; 72715#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; 72714#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 72709#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72707#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; 71118#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71119#$Ultimate##0 ~n := #in~n; 72618#L25 assume !(~n <= 0); 72605#L26 call #t~ret0 := fact(~n - 1);< 72608#$Ultimate##0 ~n := #in~n; 72602#L25 assume !(~n <= 0); 72598#L26 call #t~ret0 := fact(~n - 1);< 72601#$Ultimate##0 ~n := #in~n; 72597#L25 assume ~n <= 0;#res := 1; 72599#factFINAL assume true; 72719#factEXIT >#70#return; 72718#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72717#factFINAL assume true; 72702#factEXIT >#70#return; 72700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72698#factFINAL assume true; 72691#factEXIT >#78#return; 72692#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72689#$Ultimate##0 ~n := #in~n; 72763#L25 assume ~n <= 0;#res := 1; 72762#factFINAL assume true; 72761#factEXIT >#80#return; 72744#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72759#$Ultimate##0 ~n := #in~n; 72743#L25 assume !(~n <= 0); 72570#L26 call #t~ret0 := fact(~n - 1);< 72596#$Ultimate##0 ~n := #in~n; 72624#L25 assume !(~n <= 0); 72565#L26 call #t~ret0 := fact(~n - 1);< 72623#$Ultimate##0 ~n := #in~n; 72620#L25 assume ~n <= 0;#res := 1; 72621#factFINAL assume true; 72607#factEXIT >#70#return; 72600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72594#factFINAL assume true; 72595#factEXIT >#70#return; 72731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72760#factFINAL assume true; 72757#factEXIT >#82#return; 72758#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; 72753#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; 72754#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 72733#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72734#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; 72557#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72558#$Ultimate##0 ~n := #in~n; 72640#L25 assume !(~n <= 0); 72568#L26 call #t~ret0 := fact(~n - 1);< 72596#$Ultimate##0 ~n := #in~n; 72624#L25 assume !(~n <= 0); 72565#L26 call #t~ret0 := fact(~n - 1);< 72623#$Ultimate##0 ~n := #in~n; 72624#L25 assume !(~n <= 0); 72565#L26 call #t~ret0 := fact(~n - 1);< 72623#$Ultimate##0 ~n := #in~n; 72620#L25 assume ~n <= 0;#res := 1; 72621#factFINAL assume true; 72607#factEXIT >#70#return; 72600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72594#factFINAL assume true; 72595#factEXIT >#70#return; 72730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72729#factFINAL assume true; 72564#factEXIT >#70#return; 72563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72559#factFINAL assume true; 72562#factEXIT >#78#return; 71185#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71195#$Ultimate##0 ~n := #in~n; 71183#L25 assume ~n <= 0;#res := 1; 71186#factFINAL assume true; 72552#factEXIT >#80#return; 71124#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71202#$Ultimate##0 ~n := #in~n; 72533#L25 assume !(~n <= 0); 71152#L26 call #t~ret0 := fact(~n - 1);< 71153#$Ultimate##0 ~n := #in~n; 72528#L25 assume !(~n <= 0); 72449#L26 call #t~ret0 := fact(~n - 1);< 72526#$Ultimate##0 ~n := #in~n; 72532#L25 assume ~n <= 0;#res := 1; 72531#factFINAL assume true; 72525#factEXIT >#70#return; 72524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72523#factFINAL assume true; 72518#factEXIT >#70#return; 72501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72875#factFINAL assume true; 72852#factEXIT >#82#return; 72412#L30-8 [2024-11-23 02:07:04,674 INFO L747 eck$LassoCheckResult]: Loop: 72412#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; 72469#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; 72465#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 72459#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72458#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; 72410#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72455#$Ultimate##0 ~n := #in~n; 72522#L25 assume !(~n <= 0); 72452#L26 call #t~ret0 := fact(~n - 1);< 71153#$Ultimate##0 ~n := #in~n; 72528#L25 assume !(~n <= 0); 72449#L26 call #t~ret0 := fact(~n - 1);< 72526#$Ultimate##0 ~n := #in~n; 72528#L25 assume !(~n <= 0); 72449#L26 call #t~ret0 := fact(~n - 1);< 72526#$Ultimate##0 ~n := #in~n; 72528#L25 assume !(~n <= 0); 72449#L26 call #t~ret0 := fact(~n - 1);< 72526#$Ultimate##0 ~n := #in~n; 72528#L25 assume !(~n <= 0); 72449#L26 call #t~ret0 := fact(~n - 1);< 72526#$Ultimate##0 ~n := #in~n; 72532#L25 assume ~n <= 0;#res := 1; 72531#factFINAL assume true; 72525#factEXIT >#70#return; 72524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72523#factFINAL assume true; 72518#factEXIT >#70#return; 72514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72512#factFINAL assume true; 72500#factEXIT >#70#return; 72498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72496#factFINAL assume true; 72495#factEXIT >#70#return; 72454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72493#factFINAL assume true; 72447#factEXIT >#70#return; 72446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72440#factFINAL assume true; 72409#factEXIT >#78#return; 71197#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71198#$Ultimate##0 ~n := #in~n; 72445#L25 assume ~n <= 0;#res := 1; 72444#factFINAL assume true; 72443#factEXIT >#80#return; 72411#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72441#$Ultimate##0 ~n := #in~n; 72521#L25 assume !(~n <= 0); 72448#L26 call #t~ret0 := fact(~n - 1);< 72529#$Ultimate##0 ~n := #in~n; 72527#L25 assume !(~n <= 0); 72450#L26 call #t~ret0 := fact(~n - 1);< 72494#$Ultimate##0 ~n := #in~n; 72530#L25 assume !(~n <= 0); 72451#L26 call #t~ret0 := fact(~n - 1);< 72502#$Ultimate##0 ~n := #in~n; 72520#L25 assume !(~n <= 0); 72453#L26 call #t~ret0 := fact(~n - 1);< 72519#$Ultimate##0 ~n := #in~n; 72528#L25 assume !(~n <= 0); 72449#L26 call #t~ret0 := fact(~n - 1);< 72526#$Ultimate##0 ~n := #in~n; 72532#L25 assume ~n <= 0;#res := 1; 72531#factFINAL assume true; 72525#factEXIT >#70#return; 72524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72523#factFINAL assume true; 72518#factEXIT >#70#return; 72514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72512#factFINAL assume true; 72500#factEXIT >#70#return; 72498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72496#factFINAL assume true; 72495#factEXIT >#70#return; 72454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72493#factFINAL assume true; 72447#factEXIT >#70#return; 72446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72440#factFINAL assume true; 72409#factEXIT >#82#return; 72412#L30-8 [2024-11-23 02:07:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1182061097, now seen corresponding path program 7 times [2024-11-23 02:07:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882144237] [2024-11-23 02:07:04,675 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 240 proven. 80 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2024-11-23 02:07:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882144237] [2024-11-23 02:07:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882144237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680910632] [2024-11-23 02:07:04,872 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:04,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:04,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:04,874 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2024-11-23 02:07:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:04,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 02:07:04,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 236 proven. 13 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2024-11-23 02:07:05,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 236 proven. 17 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-11-23 02:07:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680910632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:05,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 22 [2024-11-23 02:07:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096471955] [2024-11-23 02:07:05,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:05,349 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:05,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 757551868, now seen corresponding path program 6 times [2024-11-23 02:07:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256563461] [2024-11-23 02:07:05,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:05,360 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2024-11-23 02:07:05,360 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643786562] [2024-11-23 02:07:05,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:05,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:05,363 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:05,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2024-11-23 02:07:05,471 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2024-11-23 02:07:05,471 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:05,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:05,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:05,866 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:05,866 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:05,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:05,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:05,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:05,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:05,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:05,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:05,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2024-11-23 02:07:05,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:05,866 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:05,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:05,924 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:05,925 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:05,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:05,926 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-11-23 02:07:05,929 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-11-23 02:07:05,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:05,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:05,940 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:05,940 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:05,946 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-11-23 02:07:05,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:05,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:05,947 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-11-23 02:07:05,948 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-11-23 02:07:05,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:05,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:05,959 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:05,959 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-11-23 02:07:05,965 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-11-23 02:07:05,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:05,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:05,966 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:05,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-11-23 02:07:05,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:05,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:05,978 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:05,978 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-11-23 02:07:05,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:05,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:05,985 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-11-23 02:07:05,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:05,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:05,997 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:05,997 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=120} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=120} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:06,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-11-23 02:07:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,004 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:06,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-11-23 02:07:06,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:06,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:06,016 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:06,016 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-11-23 02:07:06,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-11-23 02:07:06,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,023 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:06,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-11-23 02:07:06,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:06,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:06,034 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:06,034 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=5} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:06,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2024-11-23 02:07:06,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,041 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-11-23 02:07:06,042 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-11-23 02:07:06,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:06,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:06,053 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:06,053 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-11-23 02:07:06,059 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-11-23 02:07:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,060 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-11-23 02:07:06,061 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-11-23 02:07:06,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:06,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:06,077 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-11-23 02:07:06,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,080 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-11-23 02:07:06,081 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-11-23 02:07:06,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:06,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:06,094 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:06,100 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-11-23 02:07:06,101 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:06,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:06,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:06,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:06,101 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:06,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,101 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:06,101 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:06,101 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2024-11-23 02:07:06,101 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:06,101 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:06,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:06,161 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:06,161 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:06,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,163 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-11-23 02:07:06,163 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-11-23 02:07:06,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,181 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-11-23 02:07:06,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,182 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-11-23 02:07:06,183 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-11-23 02:07:06,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,202 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-11-23 02:07:06,202 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-11-23 02:07:06,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,220 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-11-23 02:07:06,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,221 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-11-23 02:07:06,222 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-11-23 02:07:06,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2024-11-23 02:07:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,241 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-11-23 02:07:06,241 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-11-23 02:07:06,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:06,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,261 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-11-23 02:07:06,262 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-11-23 02:07:06,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:06,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,280 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-11-23 02:07:06,281 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-11-23 02:07:06,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:06,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:06,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,300 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:06,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2024-11-23 02:07:06,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:06,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:06,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:06,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:06,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:06,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:06,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:06,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:06,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:06,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:06,314 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:06,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:06,316 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:06,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2024-11-23 02:07:06,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:06,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:06,317 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:06,317 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-11-23 02:07:06,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:06,323 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:06,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:06,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-23 02:07:06,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:06,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-23 02:07:06,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-23 02:07:07,193 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-11-23 02:07:07,193 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1760 states and 2571 transitions. cyclomatic complexity: 838 Second operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-23 02:07:07,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1760 states and 2571 transitions. cyclomatic complexity: 838. Second operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) Result 3218 states and 4633 transitions. Complement of second has 85 states. [2024-11-23 02:07:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-23 02:07:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 82 transitions. [2024-11-23 02:07:07,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 82 transitions. Stem has 148 letters. Loop has 80 letters. [2024-11-23 02:07:07,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:07,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 82 transitions. Stem has 228 letters. Loop has 80 letters. [2024-11-23 02:07:07,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:07,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 82 transitions. Stem has 148 letters. Loop has 160 letters. [2024-11-23 02:07:07,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:07,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3218 states and 4633 transitions. [2024-11-23 02:07:07,531 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 128 [2024-11-23 02:07:07,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:07,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3218 states to 2325 states and 3382 transitions. [2024-11-23 02:07:07,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2024-11-23 02:07:07,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2024-11-23 02:07:07,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2325 states and 3382 transitions. [2024-11-23 02:07:07,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:07,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2325 states and 3382 transitions. [2024-11-23 02:07:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states and 3382 transitions. [2024-11-23 02:07:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2093. [2024-11-23 02:07:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1338 states have (on average 1.0515695067264574) internal successors, (1407), 1338 states have internal predecessors, (1407), 469 states have call successors, (515), 234 states have call predecessors, (515), 286 states have return successors, (1139), 520 states have call predecessors, (1139), 469 states have call successors, (1139) [2024-11-23 02:07:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3061 transitions. [2024-11-23 02:07:07,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2093 states and 3061 transitions. [2024-11-23 02:07:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-23 02:07:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-23 02:07:07,605 INFO L87 Difference]: Start difference. First operand 2093 states and 3061 transitions. Second operand has 23 states, 19 states have (on average 3.736842105263158) internal successors, (71), 22 states have internal predecessors, (71), 14 states have call successors, (35), 1 states have call predecessors, (35), 5 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2024-11-23 02:07:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:08,292 INFO L93 Difference]: Finished difference Result 2513 states and 3687 transitions. [2024-11-23 02:07:08,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2513 states and 3687 transitions. [2024-11-23 02:07:08,303 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 146 [2024-11-23 02:07:08,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2513 states to 2223 states and 3293 transitions. [2024-11-23 02:07:08,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 686 [2024-11-23 02:07:08,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 686 [2024-11-23 02:07:08,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2223 states and 3293 transitions. [2024-11-23 02:07:08,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:08,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2223 states and 3293 transitions. [2024-11-23 02:07:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states and 3293 transitions. [2024-11-23 02:07:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2129. [2024-11-23 02:07:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1345 states have (on average 1.0565055762081785) internal successors, (1421), 1345 states have internal predecessors, (1421), 539 states have call successors, (565), 207 states have call predecessors, (565), 245 states have return successors, (1176), 576 states have call predecessors, (1176), 539 states have call successors, (1176) [2024-11-23 02:07:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3162 transitions. [2024-11-23 02:07:08,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2129 states and 3162 transitions. [2024-11-23 02:07:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-23 02:07:08,359 INFO L425 stractBuchiCegarLoop]: Abstraction has 2129 states and 3162 transitions. [2024-11-23 02:07:08,359 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-23 02:07:08,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2129 states and 3162 transitions. [2024-11-23 02:07:08,363 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 146 [2024-11-23 02:07:08,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:08,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:08,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:08,364 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-11-23 02:07:08,364 INFO L745 eck$LassoCheckResult]: Stem: 82579#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 82499#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; 82500#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; 82524#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; 82511#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 82513#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82944#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; 82491#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82492#$Ultimate##0 ~n := #in~n; 83066#L25 assume ~n <= 0;#res := 1; 83064#factFINAL assume true; 82954#factEXIT >#72#return; 82548#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82549#$Ultimate##0 ~n := #in~n; 82956#L25 assume ~n <= 0;#res := 1; 82955#factFINAL assume true; 82952#factEXIT >#74#return; 82953#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83278#$Ultimate##0 ~n := #in~n; 83279#L25 assume ~n <= 0;#res := 1; 83277#factFINAL assume true; 82957#factEXIT >#76#return; 82958#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; 82532#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; 82533#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 83577#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82529#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; 82473#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82474#$Ultimate##0 ~n := #in~n; 83842#L25 assume !(~n <= 0); 82480#L26 call #t~ret0 := fact(~n - 1);< 83844#$Ultimate##0 ~n := #in~n; 83811#L25 assume ~n <= 0;#res := 1; 83812#factFINAL assume true; 83796#factEXIT >#70#return; 83795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83794#factFINAL assume true; 83792#factEXIT >#78#return; 83561#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 83563#$Ultimate##0 ~n := #in~n; 83568#L25 assume ~n <= 0;#res := 1; 83565#factFINAL assume true; 83560#factEXIT >#80#return; 82505#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 82580#$Ultimate##0 ~n := #in~n; 83846#L25 assume !(~n <= 0); 82478#L26 call #t~ret0 := fact(~n - 1);< 82507#$Ultimate##0 ~n := #in~n; 83815#L25 assume ~n <= 0;#res := 1; 83807#factFINAL assume true; 83808#factEXIT >#70#return; 83795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83794#factFINAL assume true; 83792#factEXIT >#82#return; 83793#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; 84020#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; 84016#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 84015#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84009#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; 84003#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84005#$Ultimate##0 ~n := #in~n; 84019#L25 assume !(~n <= 0); 84012#L26 call #t~ret0 := fact(~n - 1);< 84014#$Ultimate##0 ~n := #in~n; 84026#L25 assume !(~n <= 0); 84013#L26 call #t~ret0 := fact(~n - 1);< 84024#$Ultimate##0 ~n := #in~n; 84027#L25 assume ~n <= 0;#res := 1; 84025#factFINAL assume true; 84023#factEXIT >#70#return; 84022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84018#factFINAL assume true; 84011#factEXIT >#70#return; 84008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84007#factFINAL assume true; 84002#factEXIT >#78#return; 83997#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 83998#$Ultimate##0 ~n := #in~n; 84006#L25 assume ~n <= 0;#res := 1; 84000#factFINAL assume true; 83995#factEXIT >#80#return; 83927#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83960#$Ultimate##0 ~n := #in~n; 83932#L25 assume !(~n <= 0); 83884#L26 call #t~ret0 := fact(~n - 1);< 83925#$Ultimate##0 ~n := #in~n; 83919#L25 assume !(~n <= 0); 83887#L26 call #t~ret0 := fact(~n - 1);< 83918#$Ultimate##0 ~n := #in~n; 83915#L25 assume ~n <= 0;#res := 1; 83909#factFINAL assume true; 83910#factEXIT >#70#return; 83946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83901#factFINAL assume true; 83902#factEXIT >#70#return; 83945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84028#factFINAL assume true; 83992#factEXIT >#82#return; 83990#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; 83989#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; 83988#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 83987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 83986#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; 83861#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 83862#$Ultimate##0 ~n := #in~n; 83892#L25 assume !(~n <= 0); 83882#L26 call #t~ret0 := fact(~n - 1);< 83925#$Ultimate##0 ~n := #in~n; 83919#L25 assume !(~n <= 0); 83887#L26 call #t~ret0 := fact(~n - 1);< 83918#$Ultimate##0 ~n := #in~n; 83919#L25 assume !(~n <= 0); 83887#L26 call #t~ret0 := fact(~n - 1);< 83918#$Ultimate##0 ~n := #in~n; 83915#L25 assume ~n <= 0;#res := 1; 83909#factFINAL assume true; 83910#factEXIT >#70#return; 83946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83901#factFINAL assume true; 83902#factEXIT >#70#return; 83893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83881#factFINAL assume true; 83888#factEXIT >#70#return; 83976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83863#factFINAL assume true; 83866#factEXIT >#78#return; 83728#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 83732#$Ultimate##0 ~n := #in~n; 83857#L25 assume ~n <= 0;#res := 1; 83851#factFINAL assume true; 83852#factEXIT >#80#return; 83575#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83613#$Ultimate##0 ~n := #in~n; 83608#L25 assume !(~n <= 0); 83589#L26 call #t~ret0 := fact(~n - 1);< 83598#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83627#L25 assume ~n <= 0;#res := 1; 83626#factFINAL assume true; 83624#factEXIT >#70#return; 83623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83621#factFINAL assume true; 83619#factEXIT >#70#return; 83618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83616#factFINAL assume true; 83610#factEXIT >#70#return; 83611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83650#factFINAL assume true; 83651#factEXIT >#82#return; 83394#L30-8 [2024-11-23 02:07:08,365 INFO L747 eck$LassoCheckResult]: Loop: 83394#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; 82525#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; 82526#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 82536#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82537#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; 83570#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 83571#$Ultimate##0 ~n := #in~n; 83603#L25 assume !(~n <= 0); 83592#L26 call #t~ret0 := fact(~n - 1);< 83598#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83627#L25 assume ~n <= 0;#res := 1; 83626#factFINAL assume true; 83624#factEXIT >#70#return; 83623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83621#factFINAL assume true; 83619#factEXIT >#70#return; 83618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83616#factFINAL assume true; 83610#factEXIT >#70#return; 83607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83606#factFINAL assume true; 83605#factEXIT >#70#return; 83604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83599#factFINAL assume true; 83584#factEXIT >#70#return; 83593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83602#factFINAL assume true; 83597#factEXIT >#70#return; 83583#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83581#factFINAL assume true; 83569#factEXIT >#78#return; 82573#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82574#$Ultimate##0 ~n := #in~n; 83579#L25 assume ~n <= 0;#res := 1; 83578#factFINAL assume true; 83573#factEXIT >#80#return; 83396#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83572#$Ultimate##0 ~n := #in~n; 83601#L25 assume !(~n <= 0); 83586#L26 call #t~ret0 := fact(~n - 1);< 83596#$Ultimate##0 ~n := #in~n; 83617#L25 assume !(~n <= 0); 83588#L26 call #t~ret0 := fact(~n - 1);< 83600#$Ultimate##0 ~n := #in~n; 83622#L25 assume !(~n <= 0); 83590#L26 call #t~ret0 := fact(~n - 1);< 83612#$Ultimate##0 ~n := #in~n; 83628#L25 assume !(~n <= 0); 83591#L26 call #t~ret0 := fact(~n - 1);< 83620#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83629#L25 assume !(~n <= 0); 83585#L26 call #t~ret0 := fact(~n - 1);< 83625#$Ultimate##0 ~n := #in~n; 83627#L25 assume ~n <= 0;#res := 1; 83626#factFINAL assume true; 83624#factEXIT >#70#return; 83623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83621#factFINAL assume true; 83619#factEXIT >#70#return; 83618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83616#factFINAL assume true; 83610#factEXIT >#70#return; 83607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83606#factFINAL assume true; 83605#factEXIT >#70#return; 83604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83599#factFINAL assume true; 83584#factEXIT >#70#return; 83593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83602#factFINAL assume true; 83597#factEXIT >#70#return; 83583#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83581#factFINAL assume true; 83569#factEXIT >#82#return; 83394#L30-8 [2024-11-23 02:07:08,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1133326761, now seen corresponding path program 8 times [2024-11-23 02:07:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:08,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446661366] [2024-11-23 02:07:08,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:08,378 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:08,378 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967514129] [2024-11-23 02:07:08,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:08,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:08,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:08,382 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:08,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (210)] Waiting until timeout for monitored process [2024-11-23 02:07:08,510 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:08,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:08,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:08,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -490713092, now seen corresponding path program 7 times [2024-11-23 02:07:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536084334] [2024-11-23 02:07:08,565 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 02:07:08,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088086555] [2024-11-23 02:07:08,575 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:08,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:08,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:08,578 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:08,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (211)] Waiting until timeout for monitored process [2024-11-23 02:07:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:08,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:08,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:08,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 502707620, now seen corresponding path program 9 times [2024-11-23 02:07:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330230207] [2024-11-23 02:07:08,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:08,736 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:07:08,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3566 backedges. 959 proven. 389 refuted. 0 times theorem prover too weak. 2218 trivial. 0 not checked. [2024-11-23 02:07:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330230207] [2024-11-23 02:07:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330230207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928876346] [2024-11-23 02:07:09,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:09,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:09,067 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:09,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (212)] Waiting until timeout for monitored process [2024-11-23 02:07:09,360 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-23 02:07:09,360 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:09,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-23 02:07:09,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3566 backedges. 1062 proven. 281 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2024-11-23 02:07:09,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3566 backedges. 1062 proven. 315 refuted. 0 times theorem prover too weak. 2189 trivial. 0 not checked. [2024-11-23 02:07:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928876346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:10,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 25] total 34 [2024-11-23 02:07:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820461909] [2024-11-23 02:07:10,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:10,956 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:10,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:10,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:10,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:10,956 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:10,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:10,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:10,956 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:10,956 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2024-11-23 02:07:10,956 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:10,956 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:10,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:10,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,031 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:11,031 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,034 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2024-11-23 02:07:11,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,050 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,050 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=6} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:11,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,059 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2024-11-23 02:07:11,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,072 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,072 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=720} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=720} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:11,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,080 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2024-11-23 02:07:11,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,093 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,093 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=720} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=720} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:11,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2024-11-23 02:07:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,100 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2024-11-23 02:07:11,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,118 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,119 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-11-23 02:07:11,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2024-11-23 02:07:11,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,127 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2024-11-23 02:07:11,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,140 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,140 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-11-23 02:07:11,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,147 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2024-11-23 02:07:11,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,159 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,159 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-11-23 02:07:11,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2024-11-23 02:07:11,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,165 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2024-11-23 02:07:11,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,177 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:11,177 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-11-23 02:07:11,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,184 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2024-11-23 02:07:11,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:11,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2024-11-23 02:07:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,203 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2024-11-23 02:07:11,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:11,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:11,217 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:11,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,222 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:11,223 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:11,223 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:11,223 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:11,223 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:11,223 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,223 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:11,223 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:11,223 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2024-11-23 02:07:11,223 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:11,223 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:11,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:11,285 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:11,286 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,287 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2024-11-23 02:07:11,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2024-11-23 02:07:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,307 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2024-11-23 02:07:11,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2024-11-23 02:07:11,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,326 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2024-11-23 02:07:11,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2024-11-23 02:07:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,346 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2024-11-23 02:07:11,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2024-11-23 02:07:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,365 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2024-11-23 02:07:11,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,386 INFO L229 MonitoredProcess]: Starting monitored process 227 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2024-11-23 02:07:11,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2024-11-23 02:07:11,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,407 INFO L229 MonitoredProcess]: Starting monitored process 228 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2024-11-23 02:07:11,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:11,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,427 INFO L229 MonitoredProcess]: Starting monitored process 229 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2024-11-23 02:07:11,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2024-11-23 02:07:11,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,446 INFO L229 MonitoredProcess]: Starting monitored process 230 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2024-11-23 02:07:11,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:11,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2024-11-23 02:07:11,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,465 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2024-11-23 02:07:11,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:11,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:11,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:11,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:11,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:11,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:11,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:11,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:11,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:11,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:11,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:11,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:11,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:11,481 INFO L229 MonitoredProcess]: Starting monitored process 232 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:11,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2024-11-23 02:07:11,482 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:11,482 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:11,482 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:11,482 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-11-23 02:07:11,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2024-11-23 02:07:11,488 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:11,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2024-11-23 02:07:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:11,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-23 02:07:11,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:12,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-23 02:07:12,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-23 02:07:12,487 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-11-23 02:07:12,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2129 states and 3162 transitions. cyclomatic complexity: 1064 Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-23 02:07:12,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2129 states and 3162 transitions. cyclomatic complexity: 1064. Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 3848 states and 5514 transitions. Complement of second has 97 states. [2024-11-23 02:07:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-23 02:07:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 88 transitions. [2024-11-23 02:07:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 88 transitions. Stem has 154 letters. Loop has 92 letters. [2024-11-23 02:07:12,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 88 transitions. Stem has 246 letters. Loop has 92 letters. [2024-11-23 02:07:12,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:12,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 88 transitions. Stem has 154 letters. Loop has 184 letters. [2024-11-23 02:07:12,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:12,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3848 states and 5514 transitions. [2024-11-23 02:07:12,816 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 146 [2024-11-23 02:07:12,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3848 states to 2822 states and 4124 transitions. [2024-11-23 02:07:12,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2024-11-23 02:07:12,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 694 [2024-11-23 02:07:12,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2822 states and 4124 transitions. [2024-11-23 02:07:12,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:12,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2822 states and 4124 transitions. [2024-11-23 02:07:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states and 4124 transitions. [2024-11-23 02:07:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2358. [2024-11-23 02:07:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1497 states have (on average 1.0521042084168337) internal successors, (1575), 1497 states have internal predecessors, (1575), 568 states have call successors, (606), 238 states have call predecessors, (606), 293 states have return successors, (1346), 622 states have call predecessors, (1346), 568 states have call successors, (1346) [2024-11-23 02:07:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3527 transitions. [2024-11-23 02:07:12,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2358 states and 3527 transitions. [2024-11-23 02:07:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:12,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-23 02:07:12,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2024-11-23 02:07:12,876 INFO L87 Difference]: Start difference. First operand 2358 states and 3527 transitions. Second operand has 35 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 33 states have internal predecessors, (89), 20 states have call successors, (40), 1 states have call predecessors, (40), 11 states have return successors, (46), 19 states have call predecessors, (46), 20 states have call successors, (46) [2024-11-23 02:07:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:13,705 INFO L93 Difference]: Finished difference Result 3591 states and 6048 transitions. [2024-11-23 02:07:13,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3591 states and 6048 transitions. [2024-11-23 02:07:13,727 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 313 [2024-11-23 02:07:13,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3591 states to 3414 states and 5654 transitions. [2024-11-23 02:07:13,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1002 [2024-11-23 02:07:13,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1002 [2024-11-23 02:07:13,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3414 states and 5654 transitions. [2024-11-23 02:07:13,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:13,753 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3414 states and 5654 transitions. [2024-11-23 02:07:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states and 5654 transitions. [2024-11-23 02:07:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3121. [2024-11-23 02:07:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 1862 states have (on average 1.056390977443609) internal successors, (1967), 1862 states have internal predecessors, (1967), 921 states have call successors, (968), 233 states have call predecessors, (968), 338 states have return successors, (2296), 1025 states have call predecessors, (2296), 921 states have call successors, (2296) [2024-11-23 02:07:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5231 transitions. [2024-11-23 02:07:13,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3121 states and 5231 transitions. [2024-11-23 02:07:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-23 02:07:13,821 INFO L425 stractBuchiCegarLoop]: Abstraction has 3121 states and 5231 transitions. [2024-11-23 02:07:13,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-23 02:07:13,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3121 states and 5231 transitions. [2024-11-23 02:07:13,829 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 264 [2024-11-23 02:07:13,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:13,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:13,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 19, 17, 17, 17, 17, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-23 02:07:13,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [55, 55, 40, 40, 40, 40, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-23 02:07:13,831 INFO L745 eck$LassoCheckResult]: Stem: 96922#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 96862#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; 96863#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; 96885#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; 96923#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97586#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97584#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; 96851#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 96852#$Ultimate##0 ~n := #in~n; 97364#L25 assume ~n <= 0;#res := 1; 97363#factFINAL assume true; 97361#factEXIT >#72#return; 96914#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 96915#$Ultimate##0 ~n := #in~n; 97589#L25 assume ~n <= 0;#res := 1; 97588#factFINAL assume true; 97585#factEXIT >#74#return; 96847#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96848#$Ultimate##0 ~n := #in~n; 97457#L25 assume ~n <= 0;#res := 1; 97454#factFINAL assume true; 97451#factEXIT >#76#return; 96880#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; 96881#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; 96896#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 99338#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99337#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; 99270#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99290#$Ultimate##0 ~n := #in~n; 99304#L25 assume !(~n <= 0); 99300#L26 call #t~ret0 := fact(~n - 1);< 99303#$Ultimate##0 ~n := #in~n; 99321#L25 assume ~n <= 0;#res := 1; 99331#factFINAL assume true; 99326#factEXIT >#70#return; 99324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99322#factFINAL assume true; 99269#factEXIT >#78#return; 99273#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99285#$Ultimate##0 ~n := #in~n; 99291#L25 assume ~n <= 0;#res := 1; 99288#factFINAL assume true; 99283#factEXIT >#80#return; 99271#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99275#$Ultimate##0 ~n := #in~n; 99340#L25 assume !(~n <= 0); 99301#L26 call #t~ret0 := fact(~n - 1);< 99328#$Ultimate##0 ~n := #in~n; 99330#L25 assume ~n <= 0;#res := 1; 99329#factFINAL assume true; 99327#factEXIT >#70#return; 99324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99322#factFINAL assume true; 99269#factEXIT >#82#return; 99274#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; 99278#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; 99276#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 99268#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99266#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; 99252#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99254#$Ultimate##0 ~n := #in~n; 99339#L25 assume !(~n <= 0); 99307#L26 call #t~ret0 := fact(~n - 1);< 99309#$Ultimate##0 ~n := #in~n; 99317#L25 assume !(~n <= 0); 99308#L26 call #t~ret0 := fact(~n - 1);< 99315#$Ultimate##0 ~n := #in~n; 99334#L25 assume ~n <= 0;#res := 1; 99332#factFINAL assume true; 99314#factEXIT >#70#return; 99312#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99311#factFINAL assume true; 99306#factEXIT >#70#return; 99305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99264#factFINAL assume true; 99251#factEXIT >#78#return; 99120#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99123#$Ultimate##0 ~n := #in~n; 99130#L25 assume ~n <= 0;#res := 1; 99131#factFINAL assume true; 99119#factEXIT >#80#return; 97740#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99151#$Ultimate##0 ~n := #in~n; 99172#L25 assume !(~n <= 0); 99158#L26 call #t~ret0 := fact(~n - 1);< 99163#$Ultimate##0 ~n := #in~n; 99181#L25 assume !(~n <= 0); 99156#L26 call #t~ret0 := fact(~n - 1);< 99177#$Ultimate##0 ~n := #in~n; 99187#L25 assume ~n <= 0;#res := 1; 99186#factFINAL assume true; 99176#factEXIT >#70#return; 99173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99171#factFINAL assume true; 99169#factEXIT >#70#return; 99170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99593#factFINAL assume true; 97735#factEXIT >#82#return; 97733#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; 97734#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; 99143#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 96937#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 96928#L42-4 havoc main_~k~0#1; 96883#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 96884#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97115#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97112#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; 97109#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97110#$Ultimate##0 ~n := #in~n; 97113#L25 assume ~n <= 0;#res := 1; 97111#factFINAL assume true; 97108#factEXIT >#72#return; 97102#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97106#$Ultimate##0 ~n := #in~n; 97107#L25 assume ~n <= 0;#res := 1; 97105#factFINAL assume true; 97101#factEXIT >#74#return; 97103#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97104#$Ultimate##0 ~n := #in~n; 97124#L25 assume ~n <= 0;#res := 1; 97105#factFINAL assume true; 97101#factEXIT >#76#return; 97100#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; 97099#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; 97098#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97097#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97096#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; 97043#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97095#$Ultimate##0 ~n := #in~n; 97187#L25 assume !(~n <= 0); 97139#L26 call #t~ret0 := fact(~n - 1);< 97143#$Ultimate##0 ~n := #in~n; 97150#L25 assume ~n <= 0;#res := 1; 97136#factFINAL assume true; 97142#factEXIT >#70#return; 97171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97013#factFINAL assume true; 97092#factEXIT >#78#return; 97076#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97189#$Ultimate##0 ~n := #in~n; 97298#L25 assume ~n <= 0;#res := 1; 97224#factFINAL assume true; 97196#factEXIT >#80#return; 97015#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97094#$Ultimate##0 ~n := #in~n; 97185#L25 assume !(~n <= 0); 97139#L26 call #t~ret0 := fact(~n - 1);< 97143#$Ultimate##0 ~n := #in~n; 97150#L25 assume ~n <= 0;#res := 1; 97136#factFINAL assume true; 97142#factEXIT >#70#return; 97171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97013#factFINAL assume true; 97092#factEXIT >#82#return; 97190#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; 97534#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; 97533#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97532#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97531#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; 97051#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97095#$Ultimate##0 ~n := #in~n; 97187#L25 assume !(~n <= 0); 97139#L26 call #t~ret0 := fact(~n - 1);< 97143#$Ultimate##0 ~n := #in~n; 97304#L25 assume !(~n <= 0); 97238#L26 call #t~ret0 := fact(~n - 1);< 97301#$Ultimate##0 ~n := #in~n; 97305#L25 assume ~n <= 0;#res := 1; 97302#factFINAL assume true; 97300#factEXIT >#70#return; 97299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97243#factFINAL assume true; 97236#factEXIT >#70#return; 97234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97232#factFINAL assume true; 97226#factEXIT >#78#return; 97204#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97225#$Ultimate##0 ~n := #in~n; 97231#L25 assume ~n <= 0;#res := 1; 97224#factFINAL assume true; 97196#factEXIT >#80#return; 97024#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97094#$Ultimate##0 ~n := #in~n; 97185#L25 assume !(~n <= 0); 97139#L26 call #t~ret0 := fact(~n - 1);< 97143#$Ultimate##0 ~n := #in~n; 97304#L25 assume !(~n <= 0); 97238#L26 call #t~ret0 := fact(~n - 1);< 97301#$Ultimate##0 ~n := #in~n; 97305#L25 assume ~n <= 0;#res := 1; 97302#factFINAL assume true; 97300#factEXIT >#70#return; 97299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97243#factFINAL assume true; 97236#factEXIT >#70#return; 97234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97232#factFINAL assume true; 97226#factEXIT >#82#return; 97228#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; 97529#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; 97526#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97524#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 97489#L42-4 havoc main_~k~0#1; 97927#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 97178#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 96876#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97926#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; 97880#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97889#$Ultimate##0 ~n := #in~n; 97891#L25 assume !(~n <= 0); 97828#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 98037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98033#factFINAL assume true; 97937#factEXIT >#70#return; 97939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99900#factFINAL assume true; 99883#factEXIT >#70#return; 97916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97934#factFINAL assume true; 97932#factEXIT >#72#return; 97875#L30-1 [2024-11-23 02:07:13,831 INFO L747 eck$LassoCheckResult]: Loop: 97875#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97889#$Ultimate##0 ~n := #in~n; 97891#L25 assume ~n <= 0;#res := 1; 97890#factFINAL assume true; 97886#factEXIT >#74#return; 97884#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97885#$Ultimate##0 ~n := #in~n; 97948#L25 assume !(~n <= 0); 97907#L26 call #t~ret0 := fact(~n - 1);< 97920#$Ultimate##0 ~n := #in~n; 98035#L25 assume !(~n <= 0); 97908#L26 call #t~ret0 := fact(~n - 1);< 97951#$Ultimate##0 ~n := #in~n; 98056#L25 assume !(~n <= 0); 97912#L26 call #t~ret0 := fact(~n - 1);< 98031#$Ultimate##0 ~n := #in~n; 98057#L25 assume !(~n <= 0); 97913#L26 call #t~ret0 := fact(~n - 1);< 98038#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 98037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98033#factFINAL assume true; 97937#factEXIT >#70#return; 97939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99900#factFINAL assume true; 99883#factEXIT >#70#return; 97916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97934#factFINAL assume true; 97932#factEXIT >#76#return; 97781#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; 97861#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; 97860#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97859#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97858#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; 97798#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97803#$Ultimate##0 ~n := #in~n; 97930#L25 assume !(~n <= 0); 97914#L26 call #t~ret0 := fact(~n - 1);< 97943#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 97807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97808#factFINAL assume true; 98232#factEXIT >#72#return; 97773#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97804#$Ultimate##0 ~n := #in~n; 97823#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 97846#L25 assume ~n <= 0;#res := 1; 97842#factFINAL assume true; 97827#factEXIT >#70#return; 97826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97825#factFINAL assume true; 97744#factEXIT >#74#return; 97755#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97785#$Ultimate##0 ~n := #in~n; 97844#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 97846#L25 assume ~n <= 0;#res := 1; 97842#factFINAL assume true; 97827#factEXIT >#70#return; 97826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97825#factFINAL assume true; 97744#factEXIT >#76#return; 97783#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; 97853#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; 97852#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97851#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97850#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; 97795#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97803#$Ultimate##0 ~n := #in~n; 97930#L25 assume !(~n <= 0); 97914#L26 call #t~ret0 := fact(~n - 1);< 97943#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 97807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97808#factFINAL assume true; 98232#factEXIT >#72#return; 97746#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97804#$Ultimate##0 ~n := #in~n; 97823#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 97807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97808#factFINAL assume true; 98232#factEXIT >#74#return; 97753#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97804#$Ultimate##0 ~n := #in~n; 97823#L25 assume ~n <= 0;#res := 1; 97818#factFINAL assume true; 97816#factEXIT >#76#return; 97815#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; 97814#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; 97813#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97812#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97811#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; 97764#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97804#$Ultimate##0 ~n := #in~n; 97823#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 97807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97808#factFINAL assume true; 98232#factEXIT >#78#return; 97800#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97803#$Ultimate##0 ~n := #in~n; 97930#L25 assume !(~n <= 0); 97914#L26 call #t~ret0 := fact(~n - 1);< 97943#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 98037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98033#factFINAL assume true; 97937#factEXIT >#70#return; 97939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99900#factFINAL assume true; 99883#factEXIT >#70#return; 99882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99881#factFINAL assume true; 99816#factEXIT >#80#return; 97776#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97785#$Ultimate##0 ~n := #in~n; 97844#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 97846#L25 assume ~n <= 0;#res := 1; 97842#factFINAL assume true; 97827#factEXIT >#70#return; 97826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97825#factFINAL assume true; 97744#factEXIT >#82#return; 97784#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; 97929#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; 97928#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 96932#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 96934#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; 97765#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97804#$Ultimate##0 ~n := #in~n; 97823#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 97807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97808#factFINAL assume true; 98232#factEXIT >#78#return; 97801#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97803#$Ultimate##0 ~n := #in~n; 97930#L25 assume !(~n <= 0); 97914#L26 call #t~ret0 := fact(~n - 1);< 97943#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 98037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98033#factFINAL assume true; 97937#factEXIT >#70#return; 97939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99900#factFINAL assume true; 99883#factEXIT >#70#return; 99882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99881#factFINAL assume true; 99816#factEXIT >#80#return; 97777#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97785#$Ultimate##0 ~n := #in~n; 97844#L25 assume !(~n <= 0); 97824#L26 call #t~ret0 := fact(~n - 1);< 97840#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98233#factFINAL assume true; 97819#factEXIT >#82#return; 97822#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; 98253#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; 98252#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 98237#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 96927#L42-4 havoc main_~k~0#1; 96882#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 96873#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 96874#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97925#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; 97897#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97899#$Ultimate##0 ~n := #in~n; 97936#L25 assume !(~n <= 0); 97909#L26 call #t~ret0 := fact(~n - 1);< 97943#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98034#L25 assume !(~n <= 0); 97915#L26 call #t~ret0 := fact(~n - 1);< 98030#$Ultimate##0 ~n := #in~n; 98036#L25 assume ~n <= 0;#res := 1; 98032#factFINAL assume true; 98024#factEXIT >#70#return; 98004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98005#factFINAL assume true; 98025#factEXIT >#70#return; 98026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97949#factFINAL assume true; 97950#factEXIT >#70#return; 98037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98033#factFINAL assume true; 97937#factEXIT >#70#return; 97939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99900#factFINAL assume true; 99883#factEXIT >#70#return; 97916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97934#factFINAL assume true; 97932#factEXIT >#72#return; 97875#L30-1 [2024-11-23 02:07:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2057047234, now seen corresponding path program 7 times [2024-11-23 02:07:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:13,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801827257] [2024-11-23 02:07:13,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:13,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2024-11-23 02:07:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801827257] [2024-11-23 02:07:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801827257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480179649] [2024-11-23 02:07:13,938 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:13,940 INFO L229 MonitoredProcess]: Starting monitored process 233 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:13,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (233)] Waiting until timeout for monitored process [2024-11-23 02:07:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:14,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:07:14,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 1536 proven. 1 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-11-23 02:07:14,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 124 proven. 61 refuted. 0 times theorem prover too weak. 2721 trivial. 0 not checked. [2024-11-23 02:07:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480179649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:14,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2024-11-23 02:07:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339857395] [2024-11-23 02:07:14,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:14,306 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:14,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash -828770876, now seen corresponding path program 11 times [2024-11-23 02:07:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369647872] [2024-11-23 02:07:14,306 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:14,318 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-11-23 02:07:14,318 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7555 backedges. 883 proven. 845 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2024-11-23 02:07:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369647872] [2024-11-23 02:07:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369647872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104017829] [2024-11-23 02:07:14,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:14,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:14,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:14,455 INFO L229 MonitoredProcess]: Starting monitored process 234 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (234)] Waiting until timeout for monitored process [2024-11-23 02:07:14,593 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-11-23 02:07:14,593 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:14,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-23 02:07:14,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7555 backedges. 4464 proven. 187 refuted. 0 times theorem prover too weak. 2904 trivial. 0 not checked. [2024-11-23 02:07:14,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7555 backedges. 978 proven. 961 refuted. 0 times theorem prover too weak. 5616 trivial. 0 not checked. [2024-11-23 02:07:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104017829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:15,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:15,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 20] total 27 [2024-11-23 02:07:15,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539305507] [2024-11-23 02:07:15,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:15,601 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 02:07:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-23 02:07:15,602 INFO L87 Difference]: Start difference. First operand 3121 states and 5231 transitions. cyclomatic complexity: 2145 Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-23 02:07:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:15,790 INFO L93 Difference]: Finished difference Result 2588 states and 4213 transitions. [2024-11-23 02:07:15,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2588 states and 4213 transitions. [2024-11-23 02:07:15,806 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 202 [2024-11-23 02:07:15,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2588 states to 2305 states and 3687 transitions. [2024-11-23 02:07:15,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2024-11-23 02:07:15,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 651 [2024-11-23 02:07:15,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2305 states and 3687 transitions. [2024-11-23 02:07:15,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:15,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2305 states and 3687 transitions. [2024-11-23 02:07:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states and 3687 transitions. [2024-11-23 02:07:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2295. [2024-11-23 02:07:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1399 states have (on average 1.0400285918513223) internal successors, (1455), 1401 states have internal predecessors, (1455), 594 states have call successors, (641), 204 states have call predecessors, (641), 302 states have return successors, (1581), 689 states have call predecessors, (1581), 594 states have call successors, (1581) [2024-11-23 02:07:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3677 transitions. [2024-11-23 02:07:15,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2295 states and 3677 transitions. [2024-11-23 02:07:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 02:07:15,865 INFO L425 stractBuchiCegarLoop]: Abstraction has 2295 states and 3677 transitions. [2024-11-23 02:07:15,865 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-23 02:07:15,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2295 states and 3677 transitions. [2024-11-23 02:07:15,870 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 197 [2024-11-23 02:07:15,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:15,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:15,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 32, 32, 32, 32, 18, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:15,871 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-11-23 02:07:15,871 INFO L745 eck$LassoCheckResult]: Stem: 106187#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 106131#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; 106132#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; 106154#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; 106188#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 106305#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107505#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; 106119#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106120#$Ultimate##0 ~n := #in~n; 107619#L25 assume ~n <= 0;#res := 1; 107617#factFINAL assume true; 107604#factEXIT >#72#return; 106172#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106173#$Ultimate##0 ~n := #in~n; 107588#L25 assume ~n <= 0;#res := 1; 107586#factFINAL assume true; 107577#factEXIT >#74#return; 106115#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106116#$Ultimate##0 ~n := #in~n; 107628#L25 assume ~n <= 0;#res := 1; 107627#factFINAL assume true; 107626#factEXIT >#76#return; 106148#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; 106149#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; 106161#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 107658#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107653#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; 107647#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107651#$Ultimate##0 ~n := #in~n; 107665#L25 assume !(~n <= 0); 107655#L26 call #t~ret0 := fact(~n - 1);< 107677#$Ultimate##0 ~n := #in~n; 107661#L25 assume ~n <= 0;#res := 1; 107662#factFINAL assume true; 107654#factEXIT >#70#return; 107652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107650#factFINAL assume true; 107645#factEXIT >#78#return; 107649#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107668#$Ultimate##0 ~n := #in~n; 107670#L25 assume ~n <= 0;#res := 1; 107669#factFINAL assume true; 107666#factEXIT >#80#return; 107646#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106190#$Ultimate##0 ~n := #in~n; 107671#L25 assume !(~n <= 0); 107656#L26 call #t~ret0 := fact(~n - 1);< 107657#$Ultimate##0 ~n := #in~n; 107663#L25 assume ~n <= 0;#res := 1; 107659#factFINAL assume true; 107660#factEXIT >#70#return; 107652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107650#factFINAL assume true; 107645#factEXIT >#82#return; 106133#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; 106134#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; 107848#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 107844#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107838#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; 107831#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107833#$Ultimate##0 ~n := #in~n; 107847#L25 assume !(~n <= 0); 107841#L26 call #t~ret0 := fact(~n - 1);< 107843#$Ultimate##0 ~n := #in~n; 107854#L25 assume !(~n <= 0); 107842#L26 call #t~ret0 := fact(~n - 1);< 107852#$Ultimate##0 ~n := #in~n; 107855#L25 assume ~n <= 0;#res := 1; 107853#factFINAL assume true; 107851#factEXIT >#70#return; 107850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107846#factFINAL assume true; 107840#factEXIT >#70#return; 107837#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107835#factFINAL assume true; 107830#factEXIT >#78#return; 106184#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106185#$Ultimate##0 ~n := #in~n; 108222#L25 assume ~n <= 0;#res := 1; 108233#factFINAL assume true; 108232#factEXIT >#80#return; 106128#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108179#$Ultimate##0 ~n := #in~n; 108176#L25 assume !(~n <= 0); 108158#L26 call #t~ret0 := fact(~n - 1);< 108162#$Ultimate##0 ~n := #in~n; 108175#L25 assume !(~n <= 0); 108153#L26 call #t~ret0 := fact(~n - 1);< 108178#$Ultimate##0 ~n := #in~n; 108181#L25 assume ~n <= 0;#res := 1; 108180#factFINAL assume true; 108177#factEXIT >#70#return; 108173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108172#factFINAL assume true; 108170#factEXIT >#70#return; 108171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108231#factFINAL assume true; 108230#factEXIT >#82#return; 108229#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; 108228#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; 106186#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 106167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 106160#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; 106099#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106100#$Ultimate##0 ~n := #in~n; 108168#L25 assume !(~n <= 0); 108156#L26 call #t~ret0 := fact(~n - 1);< 108162#$Ultimate##0 ~n := #in~n; 108175#L25 assume !(~n <= 0); 108153#L26 call #t~ret0 := fact(~n - 1);< 108178#$Ultimate##0 ~n := #in~n; 108175#L25 assume !(~n <= 0); 108153#L26 call #t~ret0 := fact(~n - 1);< 108178#$Ultimate##0 ~n := #in~n; 108181#L25 assume ~n <= 0;#res := 1; 108180#factFINAL assume true; 108177#factEXIT >#70#return; 108173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108172#factFINAL assume true; 108170#factEXIT >#70#return; 108169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108163#factFINAL assume true; 108152#factEXIT >#70#return; 108151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108150#factFINAL assume true; 108145#factEXIT >#78#return; 106109#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107913#$Ultimate##0 ~n := #in~n; 107916#L25 assume ~n <= 0;#res := 1; 107915#factFINAL assume true; 107912#factEXIT >#80#return; 107769#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107813#$Ultimate##0 ~n := #in~n; 107811#L25 assume !(~n <= 0); 107784#L26 call #t~ret0 := fact(~n - 1);< 107789#$Ultimate##0 ~n := #in~n; 107823#L25 assume !(~n <= 0); 107779#L26 call #t~ret0 := fact(~n - 1);< 107815#$Ultimate##0 ~n := #in~n; 107823#L25 assume !(~n <= 0); 107779#L26 call #t~ret0 := fact(~n - 1);< 107815#$Ultimate##0 ~n := #in~n; 107820#L25 assume ~n <= 0;#res := 1; 107819#factFINAL assume true; 107814#factEXIT >#70#return; 107812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107810#factFINAL assume true; 107808#factEXIT >#70#return; 107807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107803#factFINAL assume true; 107798#factEXIT >#70#return; 107799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108373#factFINAL assume true; 108288#factEXIT >#82#return; 107762#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; 107760#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; 107758#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 107757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107756#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; 107751#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107755#$Ultimate##0 ~n := #in~n; 107824#L25 assume !(~n <= 0); 107780#L26 call #t~ret0 := fact(~n - 1);< 107789#$Ultimate##0 ~n := #in~n; 107823#L25 assume !(~n <= 0); 107779#L26 call #t~ret0 := fact(~n - 1);< 107815#$Ultimate##0 ~n := #in~n; 107823#L25 assume !(~n <= 0); 107779#L26 call #t~ret0 := fact(~n - 1);< 107815#$Ultimate##0 ~n := #in~n; 107823#L25 assume !(~n <= 0); 107779#L26 call #t~ret0 := fact(~n - 1);< 107815#$Ultimate##0 ~n := #in~n; 107820#L25 assume ~n <= 0;#res := 1; 107819#factFINAL assume true; 107814#factEXIT >#70#return; 107812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107810#factFINAL assume true; 107808#factEXIT >#70#return; 107807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107803#factFINAL assume true; 107798#factEXIT >#70#return; 107796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107791#factFINAL assume true; 107778#factEXIT >#70#return; 107776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107759#factFINAL assume true; 107749#factEXIT >#78#return; 107741#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107745#$Ultimate##0 ~n := #in~n; 107777#L25 assume ~n <= 0;#res := 1; 107775#factFINAL assume true; 107740#factEXIT >#80#return; 107641#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107642#$Ultimate##0 ~n := #in~n; 107730#L25 assume !(~n <= 0); 107698#L26 call #t~ret0 := fact(~n - 1);< 107702#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107797#L25 assume ~n <= 0;#res := 1; 107795#factFINAL assume true; 107772#factEXIT >#70#return; 107763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107761#factFINAL assume true; 107738#factEXIT >#70#return; 107737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107735#factFINAL assume true; 107732#factEXIT >#70#return; 107731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107729#factFINAL assume true; 107726#factEXIT >#70#return; 107727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107736#factFINAL assume true; 107721#factEXIT >#82#return; 107713#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; 107633#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; 107634#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 107624#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107625#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; 106097#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106098#$Ultimate##0 ~n := #in~n; 107711#L25 assume !(~n <= 0); 107696#L26 call #t~ret0 := fact(~n - 1);< 107702#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107797#L25 assume ~n <= 0;#res := 1; 107795#factFINAL assume true; 107772#factEXIT >#70#return; 107763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107761#factFINAL assume true; 107738#factEXIT >#70#return; 107737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107735#factFINAL assume true; 107732#factEXIT >#70#return; 107731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107729#factFINAL assume true; 107726#factEXIT >#70#return; 107725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107724#factFINAL assume true; 107714#factEXIT >#70#return; 107710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107709#factFINAL assume true; 107707#factEXIT >#70#return; 107700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107704#factFINAL assume true; 107692#factEXIT >#70#return; 107690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107688#factFINAL assume true; 107686#factEXIT >#78#return; 106182#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106183#$Ultimate##0 ~n := #in~n; 107706#L25 assume ~n <= 0;#res := 1; 107703#factFINAL assume true; 107691#factEXIT >#80#return; 107640#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107689#$Ultimate##0 ~n := #in~n; 107712#L25 assume !(~n <= 0); 107699#L26 call #t~ret0 := fact(~n - 1);< 106138#$Ultimate##0 ~n := #in~n; 107748#L25 assume !(~n <= 0); 107693#L26 call #t~ret0 := fact(~n - 1);< 107705#$Ultimate##0 ~n := #in~n; 107790#L25 assume !(~n <= 0); 107695#L26 call #t~ret0 := fact(~n - 1);< 107733#$Ultimate##0 ~n := #in~n; 107774#L25 assume !(~n <= 0); 107697#L26 call #t~ret0 := fact(~n - 1);< 107739#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107797#L25 assume ~n <= 0;#res := 1; 107795#factFINAL assume true; 107772#factEXIT >#70#return; 107763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107761#factFINAL assume true; 107738#factEXIT >#70#return; 107737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107735#factFINAL assume true; 107732#factEXIT >#70#return; 107731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107729#factFINAL assume true; 107726#factEXIT >#70#return; 107725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107724#factFINAL assume true; 107714#factEXIT >#70#return; 107716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107728#factFINAL assume true; 107718#factEXIT >#82#return; 107636#L30-8 [2024-11-23 02:07:15,872 INFO L747 eck$LassoCheckResult]: Loop: 107636#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; 107637#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; 107630#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 107631#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107549#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; 107550#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106098#$Ultimate##0 ~n := #in~n; 107711#L25 assume !(~n <= 0); 107696#L26 call #t~ret0 := fact(~n - 1);< 107702#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107797#L25 assume ~n <= 0;#res := 1; 107795#factFINAL assume true; 107772#factEXIT >#70#return; 107763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107761#factFINAL assume true; 107738#factEXIT >#70#return; 107737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107735#factFINAL assume true; 107732#factEXIT >#70#return; 107731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107729#factFINAL assume true; 107726#factEXIT >#70#return; 107725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107724#factFINAL assume true; 107714#factEXIT >#70#return; 107710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107709#factFINAL assume true; 107707#factEXIT >#70#return; 107700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107704#factFINAL assume true; 107692#factEXIT >#70#return; 107690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107688#factFINAL assume true; 107686#factEXIT >#78#return; 107687#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106183#$Ultimate##0 ~n := #in~n; 107706#L25 assume ~n <= 0;#res := 1; 107703#factFINAL assume true; 107691#factEXIT >#80#return; 107639#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107689#$Ultimate##0 ~n := #in~n; 107712#L25 assume !(~n <= 0); 107699#L26 call #t~ret0 := fact(~n - 1);< 106138#$Ultimate##0 ~n := #in~n; 107748#L25 assume !(~n <= 0); 107693#L26 call #t~ret0 := fact(~n - 1);< 107705#$Ultimate##0 ~n := #in~n; 107790#L25 assume !(~n <= 0); 107695#L26 call #t~ret0 := fact(~n - 1);< 107733#$Ultimate##0 ~n := #in~n; 107774#L25 assume !(~n <= 0); 107697#L26 call #t~ret0 := fact(~n - 1);< 107739#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107802#L25 assume !(~n <= 0); 107694#L26 call #t~ret0 := fact(~n - 1);< 107773#$Ultimate##0 ~n := #in~n; 107797#L25 assume ~n <= 0;#res := 1; 107795#factFINAL assume true; 107772#factEXIT >#70#return; 107763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107761#factFINAL assume true; 107738#factEXIT >#70#return; 107737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107735#factFINAL assume true; 107732#factEXIT >#70#return; 107731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107729#factFINAL assume true; 107726#factEXIT >#70#return; 107725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107724#factFINAL assume true; 107714#factEXIT >#70#return; 107710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107709#factFINAL assume true; 107707#factEXIT >#70#return; 107708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107859#factFINAL assume true; 107638#factEXIT >#82#return; 107636#L30-8 [2024-11-23 02:07:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1231990367, now seen corresponding path program 10 times [2024-11-23 02:07:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499894329] [2024-11-23 02:07:15,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:15,895 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:15,898 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 953 proven. 292 refuted. 0 times theorem prover too weak. 4729 trivial. 0 not checked. [2024-11-23 02:07:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499894329] [2024-11-23 02:07:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499894329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161934835] [2024-11-23 02:07:16,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:16,227 INFO L229 MonitoredProcess]: Starting monitored process 235 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:16,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (235)] Waiting until timeout for monitored process [2024-11-23 02:07:16,399 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:16,399 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:16,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-23 02:07:16,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 2427 proven. 97 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2024-11-23 02:07:16,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 953 proven. 308 refuted. 0 times theorem prover too weak. 4713 trivial. 0 not checked. [2024-11-23 02:07:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161934835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:17,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 24 [2024-11-23 02:07:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485031426] [2024-11-23 02:07:17,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:17,375 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash 103996732, now seen corresponding path program 8 times [2024-11-23 02:07:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560536771] [2024-11-23 02:07:17,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:17,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:17,383 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:17,383 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 121 proven. 326 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-23 02:07:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:17,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560536771] [2024-11-23 02:07:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560536771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:17,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998723325] [2024-11-23 02:07:17,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:17,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:17,650 INFO L229 MonitoredProcess]: Starting monitored process 236 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:17,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (236)] Waiting until timeout for monitored process [2024-11-23 02:07:17,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:17,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:17,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-23 02:07:17,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 101 proven. 334 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-23 02:07:17,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 101 proven. 412 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-23 02:07:19,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998723325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:19,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:19,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 35 [2024-11-23 02:07:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938081298] [2024-11-23 02:07:19,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:19,861 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-23 02:07:19,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-11-23 02:07:19,862 INFO L87 Difference]: Start difference. First operand 2295 states and 3677 transitions. cyclomatic complexity: 1413 Second operand has 36 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (30), 17 states have call predecessors, (30), 19 states have call successors, (30) [2024-11-23 02:07:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:20,940 INFO L93 Difference]: Finished difference Result 2881 states and 4927 transitions. [2024-11-23 02:07:20,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2881 states and 4927 transitions. [2024-11-23 02:07:20,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 293 [2024-11-23 02:07:20,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2881 states to 2818 states and 4828 transitions. [2024-11-23 02:07:20,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 798 [2024-11-23 02:07:20,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 802 [2024-11-23 02:07:20,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4828 transitions. [2024-11-23 02:07:20,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:20,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4828 transitions. [2024-11-23 02:07:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4828 transitions. [2024-11-23 02:07:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2359. [2024-11-23 02:07:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 1437 states have (on average 1.0382741823242867) internal successors, (1492), 1437 states have internal predecessors, (1492), 625 states have call successors, (671), 234 states have call predecessors, (671), 297 states have return successors, (1726), 687 states have call predecessors, (1726), 625 states have call successors, (1726) [2024-11-23 02:07:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3889 transitions. [2024-11-23 02:07:21,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2359 states and 3889 transitions. [2024-11-23 02:07:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-23 02:07:21,040 INFO L425 stractBuchiCegarLoop]: Abstraction has 2359 states and 3889 transitions. [2024-11-23 02:07:21,040 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-23 02:07:21,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2359 states and 3889 transitions. [2024-11-23 02:07:21,046 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 211 [2024-11-23 02:07:21,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:21,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:21,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [49, 49, 31, 31, 31, 31, 18, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:21,048 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-11-23 02:07:21,048 INFO L745 eck$LassoCheckResult]: Stem: 113934#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 113880#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; 113881#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; 113905#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; 113935#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114052#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115286#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; 113868#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113869#$Ultimate##0 ~n := #in~n; 115341#L25 assume ~n <= 0;#res := 1; 115340#factFINAL assume true; 115339#factEXIT >#72#return; 113924#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113925#$Ultimate##0 ~n := #in~n; 115278#L25 assume ~n <= 0;#res := 1; 115276#factFINAL assume true; 115272#factEXIT >#74#return; 113864#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113865#$Ultimate##0 ~n := #in~n; 115343#L25 assume ~n <= 0;#res := 1; 115342#factFINAL assume true; 115284#factEXIT >#76#return; 115285#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; 113913#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; 113914#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 115515#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115512#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; 113848#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113849#$Ultimate##0 ~n := #in~n; 115760#L25 assume !(~n <= 0); 115757#L26 call #t~ret0 := fact(~n - 1);< 115758#$Ultimate##0 ~n := #in~n; 115762#L25 assume ~n <= 0;#res := 1; 115761#factFINAL assume true; 115759#factEXIT >#70#return; 115545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115542#factFINAL assume true; 115543#factEXIT >#78#return; 115502#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115504#$Ultimate##0 ~n := #in~n; 115506#L25 assume ~n <= 0;#res := 1; 115505#factFINAL assume true; 115501#factEXIT >#80#return; 113887#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113936#$Ultimate##0 ~n := #in~n; 115643#L25 assume !(~n <= 0); 113886#L26 call #t~ret0 := fact(~n - 1);< 113889#$Ultimate##0 ~n := #in~n; 113920#L25 assume ~n <= 0;#res := 1; 113921#factFINAL assume true; 115547#factEXIT >#70#return; 115545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115542#factFINAL assume true; 115543#factEXIT >#82#return; 115751#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; 115747#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; 115744#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 115740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115734#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; 115727#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115729#$Ultimate##0 ~n := #in~n; 115743#L25 assume !(~n <= 0); 115737#L26 call #t~ret0 := fact(~n - 1);< 115739#$Ultimate##0 ~n := #in~n; 115753#L25 assume !(~n <= 0); 115738#L26 call #t~ret0 := fact(~n - 1);< 115750#$Ultimate##0 ~n := #in~n; 115764#L25 assume ~n <= 0;#res := 1; 115752#factFINAL assume true; 115749#factEXIT >#70#return; 115746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115742#factFINAL assume true; 115736#factEXIT >#70#return; 115733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115731#factFINAL assume true; 115726#factEXIT >#78#return; 113932#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113933#$Ultimate##0 ~n := #in~n; 116120#L25 assume ~n <= 0;#res := 1; 116118#factFINAL assume true; 116117#factEXIT >#80#return; 113877#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 116032#$Ultimate##0 ~n := #in~n; 116029#L25 assume !(~n <= 0); 116013#L26 call #t~ret0 := fact(~n - 1);< 116019#$Ultimate##0 ~n := #in~n; 116034#L25 assume !(~n <= 0); 116014#L26 call #t~ret0 := fact(~n - 1);< 116031#$Ultimate##0 ~n := #in~n; 116035#L25 assume ~n <= 0;#res := 1; 116033#factFINAL assume true; 116030#factEXIT >#70#return; 116028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116027#factFINAL assume true; 116025#factEXIT >#70#return; 116026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116119#factFINAL assume true; 116115#factEXIT >#82#return; 116116#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; 113908#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; 113909#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 113919#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113912#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; 113850#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113851#$Ultimate##0 ~n := #in~n; 116023#L25 assume !(~n <= 0); 116015#L26 call #t~ret0 := fact(~n - 1);< 116019#$Ultimate##0 ~n := #in~n; 116034#L25 assume !(~n <= 0); 116014#L26 call #t~ret0 := fact(~n - 1);< 116031#$Ultimate##0 ~n := #in~n; 116034#L25 assume !(~n <= 0); 116014#L26 call #t~ret0 := fact(~n - 1);< 116031#$Ultimate##0 ~n := #in~n; 116035#L25 assume ~n <= 0;#res := 1; 116033#factFINAL assume true; 116030#factEXIT >#70#return; 116028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116027#factFINAL assume true; 116025#factEXIT >#70#return; 116024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116020#factFINAL assume true; 116009#factEXIT >#70#return; 116008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116007#factFINAL assume true; 116002#factEXIT >#78#return; 113859#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115999#$Ultimate##0 ~n := #in~n; 116001#L25 assume ~n <= 0;#res := 1; 116000#factFINAL assume true; 115998#factEXIT >#80#return; 115628#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115629#$Ultimate##0 ~n := #in~n; 115665#L25 assume !(~n <= 0); 115634#L26 call #t~ret0 := fact(~n - 1);< 115641#$Ultimate##0 ~n := #in~n; 115672#L25 assume !(~n <= 0); 115633#L26 call #t~ret0 := fact(~n - 1);< 115669#$Ultimate##0 ~n := #in~n; 115672#L25 assume !(~n <= 0); 115633#L26 call #t~ret0 := fact(~n - 1);< 115669#$Ultimate##0 ~n := #in~n; 115673#L25 assume ~n <= 0;#res := 1; 115671#factFINAL assume true; 115668#factEXIT >#70#return; 115666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115660#factFINAL assume true; 115658#factEXIT >#70#return; 115657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115656#factFINAL assume true; 115651#factEXIT >#70#return; 115652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116193#factFINAL assume true; 116143#factEXIT >#82#return; 115620#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; 115621#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; 115614#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 115615#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115607#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; 115599#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115604#$Ultimate##0 ~n := #in~n; 115649#L25 assume !(~n <= 0); 115637#L26 call #t~ret0 := fact(~n - 1);< 115641#$Ultimate##0 ~n := #in~n; 115672#L25 assume !(~n <= 0); 115633#L26 call #t~ret0 := fact(~n - 1);< 115669#$Ultimate##0 ~n := #in~n; 115672#L25 assume !(~n <= 0); 115633#L26 call #t~ret0 := fact(~n - 1);< 115669#$Ultimate##0 ~n := #in~n; 115672#L25 assume !(~n <= 0); 115633#L26 call #t~ret0 := fact(~n - 1);< 115669#$Ultimate##0 ~n := #in~n; 115673#L25 assume ~n <= 0;#res := 1; 115671#factFINAL assume true; 115668#factEXIT >#70#return; 115666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115660#factFINAL assume true; 115658#factEXIT >#70#return; 115657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115656#factFINAL assume true; 115651#factEXIT >#70#return; 115650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115645#factFINAL assume true; 115630#factEXIT >#70#return; 115622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115605#factFINAL assume true; 115597#factEXIT >#78#return; 115602#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115581#$Ultimate##0 ~n := #in~n; 115980#L25 assume ~n <= 0;#res := 1; 115979#factFINAL assume true; 115978#factEXIT >#80#return; 115841#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115846#$Ultimate##0 ~n := #in~n; 115845#L25 assume !(~n <= 0); 115802#L26 call #t~ret0 := fact(~n - 1);< 115844#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115869#L25 assume ~n <= 0;#res := 1; 115867#factFINAL assume true; 115865#factEXIT >#70#return; 115862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115858#factFINAL assume true; 115859#factEXIT >#70#return; 115870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115850#factFINAL assume true; 115851#factEXIT >#70#return; 115890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115888#factFINAL assume true; 115884#factEXIT >#70#return; 115885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115977#factFINAL assume true; 115976#factEXIT >#82#return; 115975#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; 115974#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; 115973#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 115972#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115971#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; 115788#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115790#$Ultimate##0 ~n := #in~n; 115817#L25 assume !(~n <= 0); 115803#L26 call #t~ret0 := fact(~n - 1);< 115844#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115868#L25 assume !(~n <= 0); 115799#L26 call #t~ret0 := fact(~n - 1);< 115866#$Ultimate##0 ~n := #in~n; 115869#L25 assume ~n <= 0;#res := 1; 115867#factFINAL assume true; 115865#factEXIT >#70#return; 115862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115858#factFINAL assume true; 115859#factEXIT >#70#return; 115870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115850#factFINAL assume true; 115851#factEXIT >#70#return; 115890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115888#factFINAL assume true; 115884#factEXIT >#70#return; 115882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115831#factFINAL assume true; 115832#factEXIT >#70#return; 115872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115812#factFINAL assume true; 115797#factEXIT >#70#return; 115795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115796#factFINAL assume true; 115787#factEXIT >#78#return; 115588#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115575#$Ultimate##0 ~n := #in~n; 115593#L25 assume ~n <= 0;#res := 1; 115587#factFINAL assume true; 115589#factEXIT >#80#return; 115483#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115539#$Ultimate##0 ~n := #in~n; 115540#L25 assume !(~n <= 0); 115521#L26 call #t~ret0 := fact(~n - 1);< 115536#$Ultimate##0 ~n := #in~n; 115586#L25 assume !(~n <= 0); 115520#L26 call #t~ret0 := fact(~n - 1);< 115554#$Ultimate##0 ~n := #in~n; 115595#L25 assume !(~n <= 0); 115522#L26 call #t~ret0 := fact(~n - 1);< 115559#$Ultimate##0 ~n := #in~n; 115590#L25 assume !(~n <= 0); 115523#L26 call #t~ret0 := fact(~n - 1);< 115563#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115569#L25 assume ~n <= 0;#res := 1; 115568#factFINAL assume true; 115566#factEXIT >#70#return; 115565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115564#factFINAL assume true; 115562#factEXIT >#70#return; 115561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115560#factFINAL assume true; 115558#factEXIT >#70#return; 115557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115555#factFINAL assume true; 115553#factEXIT >#70#return; 115552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115551#factFINAL assume true; 115548#factEXIT >#70#return; 115549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116183#factFINAL assume true; 116164#factEXIT >#82#return; 115481#L30-8 [2024-11-23 02:07:21,048 INFO L747 eck$LassoCheckResult]: Loop: 115481#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; 113906#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; 113907#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 113918#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113910#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; 113911#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115509#$Ultimate##0 ~n := #in~n; 115594#L25 assume !(~n <= 0); 115519#L26 call #t~ret0 := fact(~n - 1);< 115556#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115569#L25 assume ~n <= 0;#res := 1; 115568#factFINAL assume true; 115566#factEXIT >#70#return; 115565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115564#factFINAL assume true; 115562#factEXIT >#70#return; 115561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115560#factFINAL assume true; 115558#factEXIT >#70#return; 115557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115555#factFINAL assume true; 115553#factEXIT >#70#return; 115552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115551#factFINAL assume true; 115548#factEXIT >#70#return; 115546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115544#factFINAL assume true; 115538#factEXIT >#70#return; 115527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115534#factFINAL assume true; 115516#factEXIT >#70#return; 115513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115510#factFINAL assume true; 115507#factEXIT >#78#return; 113930#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113931#$Ultimate##0 ~n := #in~n; 115532#L25 assume ~n <= 0;#res := 1; 115531#factFINAL assume true; 115514#factEXIT >#80#return; 115508#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115511#$Ultimate##0 ~n := #in~n; 115533#L25 assume !(~n <= 0); 115525#L26 call #t~ret0 := fact(~n - 1);< 115530#$Ultimate##0 ~n := #in~n; 115596#L25 assume !(~n <= 0); 115526#L26 call #t~ret0 := fact(~n - 1);< 115535#$Ultimate##0 ~n := #in~n; 115644#L25 assume !(~n <= 0); 115518#L26 call #t~ret0 := fact(~n - 1);< 115550#$Ultimate##0 ~n := #in~n; 115586#L25 assume !(~n <= 0); 115520#L26 call #t~ret0 := fact(~n - 1);< 115554#$Ultimate##0 ~n := #in~n; 115595#L25 assume !(~n <= 0); 115522#L26 call #t~ret0 := fact(~n - 1);< 115559#$Ultimate##0 ~n := #in~n; 115590#L25 assume !(~n <= 0); 115523#L26 call #t~ret0 := fact(~n - 1);< 115563#$Ultimate##0 ~n := #in~n; 115570#L25 assume !(~n <= 0); 115517#L26 call #t~ret0 := fact(~n - 1);< 115567#$Ultimate##0 ~n := #in~n; 115569#L25 assume ~n <= 0;#res := 1; 115568#factFINAL assume true; 115566#factEXIT >#70#return; 115565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115564#factFINAL assume true; 115562#factEXIT >#70#return; 115561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115560#factFINAL assume true; 115558#factEXIT >#70#return; 115557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115555#factFINAL assume true; 115553#factEXIT >#70#return; 115552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115551#factFINAL assume true; 115548#factEXIT >#70#return; 115546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115544#factFINAL assume true; 115538#factEXIT >#70#return; 115527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115534#factFINAL assume true; 115516#factEXIT >#70#return; 115513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115510#factFINAL assume true; 115507#factEXIT >#82#return; 115481#L30-8 [2024-11-23 02:07:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -315267233, now seen corresponding path program 11 times [2024-11-23 02:07:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329749123] [2024-11-23 02:07:21,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:21,094 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-23 02:07:21,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 1897 proven. 247 refuted. 0 times theorem prover too weak. 3572 trivial. 0 not checked. [2024-11-23 02:07:21,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:21,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329749123] [2024-11-23 02:07:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329749123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:21,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203498962] [2024-11-23 02:07:21,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:21,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:21,541 INFO L229 MonitoredProcess]: Starting monitored process 237 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:21,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (237)] Waiting until timeout for monitored process [2024-11-23 02:07:22,152 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-23 02:07:22,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:22,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-23 02:07:22,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 1891 proven. 247 refuted. 0 times theorem prover too weak. 3578 trivial. 0 not checked. [2024-11-23 02:07:22,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 1891 proven. 302 refuted. 0 times theorem prover too weak. 3523 trivial. 0 not checked. [2024-11-23 02:07:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203498962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:23,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 31 [2024-11-23 02:07:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209521697] [2024-11-23 02:07:23,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:23,766 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1652380284, now seen corresponding path program 9 times [2024-11-23 02:07:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749953591] [2024-11-23 02:07:23,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:23,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2024-11-23 02:07:23,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:23,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324256214] [2024-11-23 02:07:23,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:23,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:23,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:23,808 INFO L229 MonitoredProcess]: Starting monitored process 238 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:23,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (238)] Waiting until timeout for monitored process [2024-11-23 02:07:23,998 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2024-11-23 02:07:23,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:23,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:24,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:24,560 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:24,560 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:24,560 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:24,560 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:24,560 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:24,560 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,560 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:24,560 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:24,560 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration28_Loop [2024-11-23 02:07:24,560 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:24,560 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:24,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,622 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:24,622 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:24,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,624 INFO L229 MonitoredProcess]: Starting monitored process 239 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2024-11-23 02:07:24,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,637 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:24,637 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:24,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:24,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,644 INFO L229 MonitoredProcess]: Starting monitored process 240 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2024-11-23 02:07:24,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,656 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:24,657 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-11-23 02:07:24,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,664 INFO L229 MonitoredProcess]: Starting monitored process 241 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2024-11-23 02:07:24,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,676 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:24,676 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-11-23 02:07:24,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,683 INFO L229 MonitoredProcess]: Starting monitored process 242 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2024-11-23 02:07:24,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,697 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:24,697 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-11-23 02:07:24,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2024-11-23 02:07:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,704 INFO L229 MonitoredProcess]: Starting monitored process 243 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2024-11-23 02:07:24,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,717 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:24,717 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-11-23 02:07:24,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2024-11-23 02:07:24,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,724 INFO L229 MonitoredProcess]: Starting monitored process 244 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2024-11-23 02:07:24,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,737 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:24,737 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=7} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:24,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2024-11-23 02:07:24,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,745 INFO L229 MonitoredProcess]: Starting monitored process 245 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2024-11-23 02:07:24,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:24,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:24,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,773 INFO L229 MonitoredProcess]: Starting monitored process 246 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2024-11-23 02:07:24,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:24,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:24,786 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:24,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2024-11-23 02:07:24,792 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:24,792 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:24,792 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:24,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:24,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:24,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:24,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:24,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration28_Loop [2024-11-23 02:07:24,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:24,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:24,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:24,856 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:24,856 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,878 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2024-11-23 02:07:24,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:24,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:24,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:24,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:24,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:24,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:24,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:24,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:24,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:24,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,903 INFO L229 MonitoredProcess]: Starting monitored process 248 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2024-11-23 02:07:24,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:24,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:24,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:24,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:24,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:24,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:24,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:24,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:24,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:24,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Ended with exit code 0 [2024-11-23 02:07:24,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,924 INFO L229 MonitoredProcess]: Starting monitored process 249 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2024-11-23 02:07:24,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:24,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:24,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:24,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:24,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:24,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:24,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:24,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:24,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:24,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2024-11-23 02:07:24,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,943 INFO L229 MonitoredProcess]: Starting monitored process 250 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2024-11-23 02:07:24,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-11-23 02:07:24,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:24,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:24,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:24,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:24,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:24,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:24,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:24,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:24,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Ended with exit code 0 [2024-11-23 02:07:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,963 INFO L229 MonitoredProcess]: Starting monitored process 251 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2024-11-23 02:07:24,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:24,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:24,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:24,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:24,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:24,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:24,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:24,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:24,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:24,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:24,984 INFO L229 MonitoredProcess]: Starting monitored process 252 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:24,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2024-11-23 02:07:24,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:24,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:24,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:24,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:24,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:24,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:24,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:24,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:24,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:25,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2024-11-23 02:07:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:25,007 INFO L229 MonitoredProcess]: Starting monitored process 253 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:25,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2024-11-23 02:07:25,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:25,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:25,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:25,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:25,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:25,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:25,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:25,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:25,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:25,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2024-11-23 02:07:25,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:25,026 INFO L229 MonitoredProcess]: Starting monitored process 254 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:25,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2024-11-23 02:07:25,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-11-23 02:07:25,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:25,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:25,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:25,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:25,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:25,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:25,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:25,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:25,041 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:25,042 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:25,043 INFO L229 MonitoredProcess]: Starting monitored process 255 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:25,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2024-11-23 02:07:25,045 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:25,045 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:25,045 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:25,045 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-11-23 02:07:25,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:25,052 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:25,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-23 02:07:25,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:26,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2024-11-23 02:07:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:26,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-23 02:07:26,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-23 02:07:26,816 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-11-23 02:07:26,816 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2359 states and 3889 transitions. cyclomatic complexity: 1561 Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-23 02:07:27,235 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2359 states and 3889 transitions. cyclomatic complexity: 1561. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) Result 4581 states and 7162 transitions. Complement of second has 109 states. [2024-11-23 02:07:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 20 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-23 02:07:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 92 transitions. [2024-11-23 02:07:27,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 92 transitions. Stem has 308 letters. Loop has 104 letters. [2024-11-23 02:07:27,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:27,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 92 transitions. Stem has 412 letters. Loop has 104 letters. [2024-11-23 02:07:27,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:27,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 92 transitions. Stem has 308 letters. Loop has 208 letters. [2024-11-23 02:07:27,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:27,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4581 states and 7162 transitions. [2024-11-23 02:07:27,258 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 211 [2024-11-23 02:07:27,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4581 states to 3068 states and 4961 transitions. [2024-11-23 02:07:27,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 708 [2024-11-23 02:07:27,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 [2024-11-23 02:07:27,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3068 states and 4961 transitions. [2024-11-23 02:07:27,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:27,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3068 states and 4961 transitions. [2024-11-23 02:07:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states and 4961 transitions. [2024-11-23 02:07:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2763. [2024-11-23 02:07:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 1693 states have (on average 1.0336680448907265) internal successors, (1750), 1693 states have internal predecessors, (1750), 693 states have call successors, (753), 288 states have call predecessors, (753), 377 states have return successors, (2021), 781 states have call predecessors, (2021), 693 states have call successors, (2021) [2024-11-23 02:07:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4524 transitions. [2024-11-23 02:07:27,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2763 states and 4524 transitions. [2024-11-23 02:07:27,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:27,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 02:07:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2024-11-23 02:07:27,340 INFO L87 Difference]: Start difference. First operand 2763 states and 4524 transitions. Second operand has 32 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 17 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (33), 16 states have call predecessors, (33), 17 states have call successors, (33) [2024-11-23 02:07:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:28,146 INFO L93 Difference]: Finished difference Result 3427 states and 5923 transitions. [2024-11-23 02:07:28,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3427 states and 5923 transitions. [2024-11-23 02:07:28,163 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 307 [2024-11-23 02:07:28,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3427 states to 3369 states and 5823 transitions. [2024-11-23 02:07:28,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 834 [2024-11-23 02:07:28,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 834 [2024-11-23 02:07:28,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 5823 transitions. [2024-11-23 02:07:28,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:28,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 5823 transitions. [2024-11-23 02:07:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 5823 transitions. [2024-11-23 02:07:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 2844. [2024-11-23 02:07:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 1723 states have (on average 1.0330818340104468) internal successors, (1780), 1721 states have internal predecessors, (1780), 741 states have call successors, (795), 306 states have call predecessors, (795), 380 states have return successors, (2133), 816 states have call predecessors, (2133), 741 states have call successors, (2133) [2024-11-23 02:07:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4708 transitions. [2024-11-23 02:07:28,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2844 states and 4708 transitions. [2024-11-23 02:07:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-23 02:07:28,242 INFO L425 stractBuchiCegarLoop]: Abstraction has 2844 states and 4708 transitions. [2024-11-23 02:07:28,242 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-11-23 02:07:28,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2844 states and 4708 transitions. [2024-11-23 02:07:28,248 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 224 [2024-11-23 02:07:28,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:28,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:28,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 48, 30, 30, 30, 30, 18, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:28,249 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-11-23 02:07:28,250 INFO L745 eck$LassoCheckResult]: Stem: 130378#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 130316#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; 130317#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; 130342#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; 130379#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 130498#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131675#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; 130305#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130306#$Ultimate##0 ~n := #in~n; 132024#L25 assume ~n <= 0;#res := 1; 132023#factFINAL assume true; 132021#factEXIT >#72#return; 130365#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130366#$Ultimate##0 ~n := #in~n; 132040#L25 assume ~n <= 0;#res := 1; 132037#factFINAL assume true; 132034#factEXIT >#74#return; 130301#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130302#$Ultimate##0 ~n := #in~n; 132757#L25 assume ~n <= 0;#res := 1; 132756#factFINAL assume true; 132754#factEXIT >#76#return; 132752#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; 130351#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; 130352#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 132082#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132045#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; 130283#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130284#$Ultimate##0 ~n := #in~n; 132276#L25 assume !(~n <= 0); 132277#L26 call #t~ret0 := fact(~n - 1);< 132465#$Ultimate##0 ~n := #in~n; 132747#L25 assume ~n <= 0;#res := 1; 132746#factFINAL assume true; 132744#factEXIT >#70#return; 132262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132115#factFINAL assume true; 132118#factEXIT >#78#return; 130374#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130375#$Ultimate##0 ~n := #in~n; 132772#L25 assume ~n <= 0;#res := 1; 132768#factFINAL assume true; 132243#factEXIT >#80#return; 132117#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132119#$Ultimate##0 ~n := #in~n; 132471#L25 assume !(~n <= 0); 132264#L26 call #t~ret0 := fact(~n - 1);< 132265#$Ultimate##0 ~n := #in~n; 132473#L25 assume ~n <= 0;#res := 1; 132748#factFINAL assume true; 132263#factEXIT >#70#return; 132262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132115#factFINAL assume true; 132118#factEXIT >#82#return; 132448#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; 132439#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; 132435#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 132434#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132433#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; 132425#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132427#$Ultimate##0 ~n := #in~n; 132459#L25 assume !(~n <= 0); 132445#L26 call #t~ret0 := fact(~n - 1);< 132447#$Ultimate##0 ~n := #in~n; 132458#L25 assume !(~n <= 0); 132446#L26 call #t~ret0 := fact(~n - 1);< 132457#$Ultimate##0 ~n := #in~n; 132466#L25 assume ~n <= 0;#res := 1; 132462#factFINAL assume true; 132456#factEXIT >#70#return; 132455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132454#factFINAL assume true; 132444#factEXIT >#70#return; 132438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132431#factFINAL assume true; 132423#factEXIT >#78#return; 132426#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 132409#$Ultimate##0 ~n := #in~n; 133040#L25 assume ~n <= 0;#res := 1; 133039#factFINAL assume true; 133038#factEXIT >#80#return; 130314#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132949#$Ultimate##0 ~n := #in~n; 132946#L25 assume !(~n <= 0); 132930#L26 call #t~ret0 := fact(~n - 1);< 132936#$Ultimate##0 ~n := #in~n; 132951#L25 assume !(~n <= 0); 132931#L26 call #t~ret0 := fact(~n - 1);< 132948#$Ultimate##0 ~n := #in~n; 132952#L25 assume ~n <= 0;#res := 1; 132950#factFINAL assume true; 132947#factEXIT >#70#return; 132945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132944#factFINAL assume true; 132942#factEXIT >#70#return; 132943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133037#factFINAL assume true; 133035#factEXIT >#82#return; 133036#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; 133034#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; 133032#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 133030#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133027#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; 130285#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130286#$Ultimate##0 ~n := #in~n; 132940#L25 assume !(~n <= 0); 132932#L26 call #t~ret0 := fact(~n - 1);< 132936#$Ultimate##0 ~n := #in~n; 132951#L25 assume !(~n <= 0); 132931#L26 call #t~ret0 := fact(~n - 1);< 132948#$Ultimate##0 ~n := #in~n; 132951#L25 assume !(~n <= 0); 132931#L26 call #t~ret0 := fact(~n - 1);< 132948#$Ultimate##0 ~n := #in~n; 132952#L25 assume ~n <= 0;#res := 1; 132950#factFINAL assume true; 132947#factEXIT >#70#return; 132945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132944#factFINAL assume true; 132942#factEXIT >#70#return; 132941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132937#factFINAL assume true; 132926#factEXIT >#70#return; 132925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132924#factFINAL assume true; 132920#factEXIT >#78#return; 130293#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 132915#$Ultimate##0 ~n := #in~n; 132918#L25 assume ~n <= 0;#res := 1; 132917#factFINAL assume true; 132914#factEXIT >#80#return; 132397#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132402#$Ultimate##0 ~n := #in~n; 132430#L25 assume !(~n <= 0); 132416#L26 call #t~ret0 := fact(~n - 1);< 132418#$Ultimate##0 ~n := #in~n; 132443#L25 assume !(~n <= 0); 132413#L26 call #t~ret0 := fact(~n - 1);< 132442#$Ultimate##0 ~n := #in~n; 132443#L25 assume !(~n <= 0); 132413#L26 call #t~ret0 := fact(~n - 1);< 132442#$Ultimate##0 ~n := #in~n; 132453#L25 assume ~n <= 0;#res := 1; 132452#factFINAL assume true; 132441#factEXIT >#70#return; 132437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132428#factFINAL assume true; 132411#factEXIT >#70#return; 132417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132489#factFINAL assume true; 132486#factEXIT >#70#return; 132488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133109#factFINAL assume true; 133090#factEXIT >#82#return; 132476#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; 132391#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; 132306#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 132307#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132300#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; 132290#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132293#$Ultimate##0 ~n := #in~n; 132503#L25 assume !(~n <= 0); 132414#L26 call #t~ret0 := fact(~n - 1);< 132418#$Ultimate##0 ~n := #in~n; 132443#L25 assume !(~n <= 0); 132413#L26 call #t~ret0 := fact(~n - 1);< 132442#$Ultimate##0 ~n := #in~n; 132443#L25 assume !(~n <= 0); 132413#L26 call #t~ret0 := fact(~n - 1);< 132442#$Ultimate##0 ~n := #in~n; 132443#L25 assume !(~n <= 0); 132413#L26 call #t~ret0 := fact(~n - 1);< 132442#$Ultimate##0 ~n := #in~n; 132453#L25 assume ~n <= 0;#res := 1; 132452#factFINAL assume true; 132441#factEXIT >#70#return; 132437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132428#factFINAL assume true; 132411#factEXIT >#70#return; 132417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132489#factFINAL assume true; 132486#factEXIT >#70#return; 132487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132661#factFINAL assume true; 132657#factEXIT >#70#return; 132656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132297#factFINAL assume true; 132286#factEXIT >#78#return; 132292#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 132283#$Ultimate##0 ~n := #in~n; 132383#L25 assume ~n <= 0;#res := 1; 132380#factFINAL assume true; 132377#factEXIT >#80#return; 132372#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132374#$Ultimate##0 ~n := #in~n; 132379#L25 assume !(~n <= 0); 132344#L26 call #t~ret0 := fact(~n - 1);< 132354#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132420#L25 assume ~n <= 0;#res := 1; 132419#factFINAL assume true; 132403#factEXIT >#70#return; 132395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132393#factFINAL assume true; 132387#factEXIT >#70#return; 132385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132384#factFINAL assume true; 132381#factEXIT >#70#return; 132378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132375#factFINAL assume true; 132366#factEXIT >#70#return; 132367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132376#factFINAL assume true; 132369#factEXIT >#82#return; 132365#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; 132362#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; 132355#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 132339#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132336#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; 132325#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132327#$Ultimate##0 ~n := #in~n; 132361#L25 assume !(~n <= 0); 132345#L26 call #t~ret0 := fact(~n - 1);< 132354#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132421#L25 assume !(~n <= 0); 132350#L26 call #t~ret0 := fact(~n - 1);< 132404#$Ultimate##0 ~n := #in~n; 132420#L25 assume ~n <= 0;#res := 1; 132419#factFINAL assume true; 132403#factEXIT >#70#return; 132395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132393#factFINAL assume true; 132387#factEXIT >#70#return; 132385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132384#factFINAL assume true; 132381#factEXIT >#70#return; 132378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132375#factFINAL assume true; 132366#factEXIT >#70#return; 132364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132357#factFINAL assume true; 132342#factEXIT >#70#return; 132338#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132335#factFINAL assume true; 132324#factEXIT >#78#return; 130288#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 132320#$Ultimate##0 ~n := #in~n; 130361#L25 assume ~n <= 0;#res := 1; 130362#factFINAL assume true; 130287#factEXIT >#80#return; 130290#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132051#$Ultimate##0 ~n := #in~n; 132120#L25 assume !(~n <= 0); 130370#L26 call #t~ret0 := fact(~n - 1);< 130369#$Ultimate##0 ~n := #in~n; 130371#L25 assume !(~n <= 0); 132089#L26 call #t~ret0 := fact(~n - 1);< 132247#$Ultimate##0 ~n := #in~n; 132888#L25 assume !(~n <= 0); 132086#L26 call #t~ret0 := fact(~n - 1);< 132763#$Ultimate##0 ~n := #in~n; 132796#L25 assume !(~n <= 0); 132085#L26 call #t~ret0 := fact(~n - 1);< 132771#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132788#L25 assume ~n <= 0;#res := 1; 132787#factFINAL assume true; 132777#factEXIT >#70#return; 132776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132774#factFINAL assume true; 132770#factEXIT >#70#return; 132767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132766#factFINAL assume true; 132762#factEXIT >#70#return; 132760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132749#factFINAL assume true; 132246#factEXIT >#70#return; 132245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132131#factFINAL assume true; 132122#factEXIT >#70#return; 132123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132896#factFINAL assume true; 132894#factEXIT >#82#return; 132050#L30-8 [2024-11-23 02:07:28,250 INFO L747 eck$LassoCheckResult]: Loop: 132050#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; 132049#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; 132048#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 132046#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132047#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; 132071#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132076#$Ultimate##0 ~n := #in~n; 132108#L25 assume !(~n <= 0); 132084#L26 call #t~ret0 := fact(~n - 1);< 132098#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132788#L25 assume ~n <= 0;#res := 1; 132787#factFINAL assume true; 132777#factEXIT >#70#return; 132776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132774#factFINAL assume true; 132770#factEXIT >#70#return; 132767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132766#factFINAL assume true; 132762#factEXIT >#70#return; 132760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132749#factFINAL assume true; 132246#factEXIT >#70#return; 132245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132131#factFINAL assume true; 132122#factEXIT >#70#return; 132114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132111#factFINAL assume true; 132110#factEXIT >#70#return; 132107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132106#factFINAL assume true; 132104#factEXIT >#70#return; 132096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132101#factFINAL assume true; 132083#factEXIT >#70#return; 132079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132077#factFINAL assume true; 132070#factEXIT >#78#return; 132073#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 132081#$Ultimate##0 ~n := #in~n; 132100#L25 assume ~n <= 0;#res := 1; 132099#factFINAL assume true; 132080#factEXIT >#80#return; 132072#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132078#$Ultimate##0 ~n := #in~n; 132109#L25 assume !(~n <= 0); 132091#L26 call #t~ret0 := fact(~n - 1);< 132102#$Ultimate##0 ~n := #in~n; 132244#L25 assume !(~n <= 0); 132092#L26 call #t~ret0 := fact(~n - 1);< 132103#$Ultimate##0 ~n := #in~n; 132593#L25 assume !(~n <= 0); 132093#L26 call #t~ret0 := fact(~n - 1);< 132125#$Ultimate##0 ~n := #in~n; 130371#L25 assume !(~n <= 0); 132089#L26 call #t~ret0 := fact(~n - 1);< 132247#$Ultimate##0 ~n := #in~n; 132888#L25 assume !(~n <= 0); 132086#L26 call #t~ret0 := fact(~n - 1);< 132763#$Ultimate##0 ~n := #in~n; 132796#L25 assume !(~n <= 0); 132085#L26 call #t~ret0 := fact(~n - 1);< 132771#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132786#L25 assume !(~n <= 0); 132087#L26 call #t~ret0 := fact(~n - 1);< 132778#$Ultimate##0 ~n := #in~n; 132788#L25 assume ~n <= 0;#res := 1; 132787#factFINAL assume true; 132777#factEXIT >#70#return; 132776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132774#factFINAL assume true; 132770#factEXIT >#70#return; 132767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132766#factFINAL assume true; 132762#factEXIT >#70#return; 132760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132749#factFINAL assume true; 132246#factEXIT >#70#return; 132245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132131#factFINAL assume true; 132122#factEXIT >#70#return; 132114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132111#factFINAL assume true; 132110#factEXIT >#70#return; 132107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132106#factFINAL assume true; 132104#factEXIT >#70#return; 132096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132101#factFINAL assume true; 132083#factEXIT >#70#return; 132079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132077#factFINAL assume true; 132070#factEXIT >#82#return; 132050#L30-8 [2024-11-23 02:07:28,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash -676404449, now seen corresponding path program 12 times [2024-11-23 02:07:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:28,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032005300] [2024-11-23 02:07:28,250 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:28,299 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-23 02:07:28,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463046076] [2024-11-23 02:07:28,301 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:28,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:28,336 INFO L229 MonitoredProcess]: Starting monitored process 256 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:28,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (256)] Waiting until timeout for monitored process [2024-11-23 02:07:28,908 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-23 02:07:28,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:28,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:29,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1898041476, now seen corresponding path program 10 times [2024-11-23 02:07:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226509710] [2024-11-23 02:07:29,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:29,030 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:29,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853361088] [2024-11-23 02:07:29,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:29,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:29,033 INFO L229 MonitoredProcess]: Starting monitored process 257 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:29,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (257)] Waiting until timeout for monitored process [2024-11-23 02:07:29,303 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:29,303 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:29,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:29,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2034077798, now seen corresponding path program 13 times [2024-11-23 02:07:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057192134] [2024-11-23 02:07:29,358 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11036 backedges. 1536 proven. 461 refuted. 0 times theorem prover too weak. 9039 trivial. 0 not checked. [2024-11-23 02:07:29,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057192134] [2024-11-23 02:07:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057192134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016225410] [2024-11-23 02:07:29,824 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:07:29,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:29,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:29,826 INFO L229 MonitoredProcess]: Starting monitored process 258 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:29,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (258)] Waiting until timeout for monitored process [2024-11-23 02:07:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:30,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 02:07:30,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11036 backedges. 4424 proven. 139 refuted. 0 times theorem prover too weak. 6473 trivial. 0 not checked. [2024-11-23 02:07:30,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11036 backedges. 1536 proven. 497 refuted. 0 times theorem prover too weak. 9003 trivial. 0 not checked. [2024-11-23 02:07:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016225410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:31,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:31,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 24] total 25 [2024-11-23 02:07:31,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53893804] [2024-11-23 02:07:31,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:32,025 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:32,025 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:32,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:32,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:32,025 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:32,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:32,025 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:32,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration29_Loop [2024-11-23 02:07:32,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:32,025 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:32,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,092 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:32,092 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:32,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,103 INFO L229 MonitoredProcess]: Starting monitored process 259 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2024-11-23 02:07:32,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:32,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:32,115 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:32,115 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-11-23 02:07:32,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2024-11-23 02:07:32,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,122 INFO L229 MonitoredProcess]: Starting monitored process 260 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2024-11-23 02:07:32,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:32,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:32,134 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:32,134 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-11-23 02:07:32,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:32,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,141 INFO L229 MonitoredProcess]: Starting monitored process 261 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2024-11-23 02:07:32,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:32,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:32,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,160 INFO L229 MonitoredProcess]: Starting monitored process 262 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2024-11-23 02:07:32,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:32,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:32,173 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:32,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2024-11-23 02:07:32,179 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:32,179 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:32,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:32,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:32,179 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:32,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:32,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:32,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration29_Loop [2024-11-23 02:07:32,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:32,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:32,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:32,241 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:32,241 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:32,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,242 INFO L229 MonitoredProcess]: Starting monitored process 263 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2024-11-23 02:07:32,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:32,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:32,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:32,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:32,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:32,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:32,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:32,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:32,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:32,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2024-11-23 02:07:32,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,262 INFO L229 MonitoredProcess]: Starting monitored process 264 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2024-11-23 02:07:32,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:32,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:32,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:32,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:32,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:32,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:32,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:32,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:32,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:32,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,282 INFO L229 MonitoredProcess]: Starting monitored process 265 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2024-11-23 02:07:32,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:32,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:32,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:32,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:32,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:32,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:32,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:32,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:32,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:32,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:32,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:32,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:32,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:32,299 INFO L229 MonitoredProcess]: Starting monitored process 266 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:32,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2024-11-23 02:07:32,300 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:32,300 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:32,300 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:32,300 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-11-23 02:07:32,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:32,305 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:32,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:32,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 2021 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-23 02:07:32,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:33,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:33,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-23 02:07:33,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-23 02:07:34,140 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-11-23 02:07:34,140 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2844 states and 4708 transitions. cyclomatic complexity: 1899 Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-23 02:07:34,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2844 states and 4708 transitions. cyclomatic complexity: 1899. Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) Result 6045 states and 9507 transitions. Complement of second has 121 states. [2024-11-23 02:07:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 2 stem states 22 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-23 02:07:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2024-11-23 02:07:34,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 98 transitions. Stem has 302 letters. Loop has 116 letters. [2024-11-23 02:07:34,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:34,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 98 transitions. Stem has 418 letters. Loop has 116 letters. [2024-11-23 02:07:34,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:34,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 98 transitions. Stem has 302 letters. Loop has 232 letters. [2024-11-23 02:07:34,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:34,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6045 states and 9507 transitions. [2024-11-23 02:07:34,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 224 [2024-11-23 02:07:34,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6045 states to 3899 states and 6308 transitions. [2024-11-23 02:07:34,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778 [2024-11-23 02:07:34,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 783 [2024-11-23 02:07:34,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3899 states and 6308 transitions. [2024-11-23 02:07:34,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:34,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3899 states and 6308 transitions. [2024-11-23 02:07:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states and 6308 transitions. [2024-11-23 02:07:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3158. [2024-11-23 02:07:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 1927 states have (on average 1.0306175402179554) internal successors, (1986), 1925 states have internal predecessors, (1986), 787 states have call successors, (855), 348 states have call predecessors, (855), 444 states have return successors, (2454), 884 states have call predecessors, (2454), 787 states have call successors, (2454) [2024-11-23 02:07:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 5295 transitions. [2024-11-23 02:07:34,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3158 states and 5295 transitions. [2024-11-23 02:07:34,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:34,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-23 02:07:34,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2024-11-23 02:07:34,698 INFO L87 Difference]: Start difference. First operand 3158 states and 5295 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 17 states have call successors, (33), 2 states have call predecessors, (33), 9 states have return successors, (38), 15 states have call predecessors, (38), 17 states have call successors, (38) [2024-11-23 02:07:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:35,332 INFO L93 Difference]: Finished difference Result 4653 states and 9220 transitions. [2024-11-23 02:07:35,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4653 states and 9220 transitions. [2024-11-23 02:07:35,361 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 530 [2024-11-23 02:07:35,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4653 states to 4611 states and 9142 transitions. [2024-11-23 02:07:35,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1447 [2024-11-23 02:07:35,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1451 [2024-11-23 02:07:35,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4611 states and 9142 transitions. [2024-11-23 02:07:35,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:35,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4611 states and 9142 transitions. [2024-11-23 02:07:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states and 9142 transitions. [2024-11-23 02:07:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 3555. [2024-11-23 02:07:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 2152 states have (on average 1.033457249070632) internal successors, (2224), 2150 states have internal predecessors, (2224), 959 states have call successors, (1038), 348 states have call predecessors, (1038), 444 states have return successors, (3132), 1056 states have call predecessors, (3132), 959 states have call successors, (3132) [2024-11-23 02:07:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 6394 transitions. [2024-11-23 02:07:35,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3555 states and 6394 transitions. [2024-11-23 02:07:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-23 02:07:35,502 INFO L425 stractBuchiCegarLoop]: Abstraction has 3555 states and 6394 transitions. [2024-11-23 02:07:35,502 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-11-23 02:07:35,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3555 states and 6394 transitions. [2024-11-23 02:07:35,511 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 429 [2024-11-23 02:07:35,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:35,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:35,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [63, 63, 42, 42, 42, 42, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:35,513 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-11-23 02:07:35,513 INFO L745 eck$LassoCheckResult]: Stem: 151174#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 151113#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; 151114#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; 151138#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; 151175#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 151309#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152943#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; 152940#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152941#$Ultimate##0 ~n := #in~n; 152944#L25 assume ~n <= 0;#res := 1; 152942#factFINAL assume true; 152939#factEXIT >#72#return; 151163#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 151164#$Ultimate##0 ~n := #in~n; 153095#L25 assume ~n <= 0;#res := 1; 153094#factFINAL assume true; 153092#factEXIT >#74#return; 153089#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153090#$Ultimate##0 ~n := #in~n; 153093#L25 assume ~n <= 0;#res := 1; 153091#factFINAL assume true; 153088#factEXIT >#76#return; 153087#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; 153086#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; 153083#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153081#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153082#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; 150969#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 150970#$Ultimate##0 ~n := #in~n; 153801#L25 assume !(~n <= 0); 153477#L26 call #t~ret0 := fact(~n - 1);< 153798#$Ultimate##0 ~n := #in~n; 153802#L25 assume ~n <= 0;#res := 1; 153800#factFINAL assume true; 153799#factEXIT >#70#return; 153796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153795#factFINAL assume true; 153792#factEXIT >#78#return; 153195#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 153197#$Ultimate##0 ~n := #in~n; 153201#L25 assume ~n <= 0;#res := 1; 153198#factFINAL assume true; 153194#factEXIT >#80#return; 151120#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 151176#$Ultimate##0 ~n := #in~n; 153370#L25 assume !(~n <= 0); 151119#L26 call #t~ret0 := fact(~n - 1);< 151122#$Ultimate##0 ~n := #in~n; 153806#L25 assume ~n <= 0;#res := 1; 153804#factFINAL assume true; 153797#factEXIT >#70#return; 153796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153795#factFINAL assume true; 153792#factEXIT >#82#return; 153793#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; 153794#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; 153791#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153789#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153787#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; 153780#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153782#$Ultimate##0 ~n := #in~n; 153811#L25 assume !(~n <= 0); 153809#L26 call #t~ret0 := fact(~n - 1);< 153810#$Ultimate##0 ~n := #in~n; 153818#L25 assume !(~n <= 0); 153808#L26 call #t~ret0 := fact(~n - 1);< 153817#$Ultimate##0 ~n := #in~n; 153822#L25 assume ~n <= 0;#res := 1; 153820#factFINAL assume true; 153816#factEXIT >#70#return; 153814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153812#factFINAL assume true; 153807#factEXIT >#70#return; 153805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153785#factFINAL assume true; 153778#factEXIT >#78#return; 153781#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 153776#$Ultimate##0 ~n := #in~n; 153949#L25 assume ~n <= 0;#res := 1; 153948#factFINAL assume true; 153947#factEXIT >#80#return; 151148#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153736#$Ultimate##0 ~n := #in~n; 153734#L25 assume !(~n <= 0); 153711#L26 call #t~ret0 := fact(~n - 1);< 153720#$Ultimate##0 ~n := #in~n; 153740#L25 assume !(~n <= 0); 153714#L26 call #t~ret0 := fact(~n - 1);< 153739#$Ultimate##0 ~n := #in~n; 153745#L25 assume ~n <= 0;#res := 1; 153741#factFINAL assume true; 153738#factEXIT >#70#return; 153737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153732#factFINAL assume true; 153730#factEXIT >#70#return; 153731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153945#factFINAL assume true; 153943#factEXIT >#82#return; 153939#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; 153934#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; 153908#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153907#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153906#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; 153705#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153706#$Ultimate##0 ~n := #in~n; 153722#L25 assume !(~n <= 0); 153712#L26 call #t~ret0 := fact(~n - 1);< 153720#$Ultimate##0 ~n := #in~n; 153740#L25 assume !(~n <= 0); 153714#L26 call #t~ret0 := fact(~n - 1);< 153739#$Ultimate##0 ~n := #in~n; 153740#L25 assume !(~n <= 0); 153714#L26 call #t~ret0 := fact(~n - 1);< 153739#$Ultimate##0 ~n := #in~n; 153745#L25 assume ~n <= 0;#res := 1; 153741#factFINAL assume true; 153738#factEXIT >#70#return; 153737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153732#factFINAL assume true; 153730#factEXIT >#70#return; 153729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153724#factFINAL assume true; 153710#factEXIT >#70#return; 153709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153707#factFINAL assume true; 153698#factEXIT >#78#return; 153693#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 153695#$Ultimate##0 ~n := #in~n; 153728#L25 assume ~n <= 0;#res := 1; 153727#factFINAL assume true; 153690#factEXIT >#80#return; 153597#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153625#$Ultimate##0 ~n := #in~n; 153676#L25 assume !(~n <= 0); 153560#L26 call #t~ret0 := fact(~n - 1);< 153568#$Ultimate##0 ~n := #in~n; 153686#L25 assume !(~n <= 0); 153559#L26 call #t~ret0 := fact(~n - 1);< 153608#$Ultimate##0 ~n := #in~n; 153686#L25 assume !(~n <= 0); 153559#L26 call #t~ret0 := fact(~n - 1);< 153608#$Ultimate##0 ~n := #in~n; 153684#L25 assume ~n <= 0;#res := 1; 153682#factFINAL assume true; 153607#factEXIT >#70#return; 153605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153604#factFINAL assume true; 153602#factEXIT >#70#return; 153601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153593#factFINAL assume true; 153578#factEXIT >#70#return; 153580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153733#factFINAL assume true; 153688#factEXIT >#82#return; 153687#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; 153685#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; 153683#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153681#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153680#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; 153541#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153551#$Ultimate##0 ~n := #in~n; 153574#L25 assume !(~n <= 0); 153563#L26 call #t~ret0 := fact(~n - 1);< 153568#$Ultimate##0 ~n := #in~n; 153686#L25 assume !(~n <= 0); 153559#L26 call #t~ret0 := fact(~n - 1);< 153608#$Ultimate##0 ~n := #in~n; 153686#L25 assume !(~n <= 0); 153559#L26 call #t~ret0 := fact(~n - 1);< 153608#$Ultimate##0 ~n := #in~n; 153686#L25 assume !(~n <= 0); 153559#L26 call #t~ret0 := fact(~n - 1);< 153608#$Ultimate##0 ~n := #in~n; 153684#L25 assume ~n <= 0;#res := 1; 153682#factFINAL assume true; 153607#factEXIT >#70#return; 153605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153604#factFINAL assume true; 153602#factEXIT >#70#return; 153601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153593#factFINAL assume true; 153578#factEXIT >#70#return; 153576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153570#factFINAL assume true; 153557#factEXIT >#70#return; 153555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153553#factFINAL assume true; 153540#factEXIT >#78#return; 153548#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 153533#$Ultimate##0 ~n := #in~n; 153723#L25 assume ~n <= 0;#res := 1; 153721#factFINAL assume true; 153708#factEXIT >#80#return; 153433#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153441#$Ultimate##0 ~n := #in~n; 153444#L25 assume !(~n <= 0); 153399#L26 call #t~ret0 := fact(~n - 1);< 153405#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153461#L25 assume ~n <= 0;#res := 1; 153460#factFINAL assume true; 153456#factEXIT >#70#return; 153455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153454#factFINAL assume true; 153453#factEXIT >#70#return; 153452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153451#factFINAL assume true; 153449#factEXIT >#70#return; 153448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153446#factFINAL assume true; 153427#factEXIT >#70#return; 153428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153443#factFINAL assume true; 153432#factEXIT >#82#return; 153430#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; 153426#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; 153424#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153423#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153422#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; 153386#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153389#$Ultimate##0 ~n := #in~n; 153407#L25 assume !(~n <= 0); 153400#L26 call #t~ret0 := fact(~n - 1);< 153405#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153459#L25 assume !(~n <= 0); 153401#L26 call #t~ret0 := fact(~n - 1);< 153457#$Ultimate##0 ~n := #in~n; 153461#L25 assume ~n <= 0;#res := 1; 153460#factFINAL assume true; 153456#factEXIT >#70#return; 153455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153454#factFINAL assume true; 153453#factEXIT >#70#return; 153452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153451#factFINAL assume true; 153449#factEXIT >#70#return; 153448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153446#factFINAL assume true; 153427#factEXIT >#70#return; 153425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153416#factFINAL assume true; 153393#factEXIT >#70#return; 153392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153391#factFINAL assume true; 153383#factEXIT >#78#return; 153388#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 153382#$Ultimate##0 ~n := #in~n; 153537#L25 assume ~n <= 0;#res := 1; 153536#factFINAL assume true; 153530#factEXIT >#80#return; 153308#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153358#$Ultimate##0 ~n := #in~n; 153357#L25 assume !(~n <= 0); 153278#L26 call #t~ret0 := fact(~n - 1);< 153304#$Ultimate##0 ~n := #in~n; 153678#L25 assume !(~n <= 0); 153282#L26 call #t~ret0 := fact(~n - 1);< 153322#$Ultimate##0 ~n := #in~n; 153899#L25 assume !(~n <= 0); 153281#L26 call #t~ret0 := fact(~n - 1);< 153354#$Ultimate##0 ~n := #in~n; 153912#L25 assume !(~n <= 0); 153284#L26 call #t~ret0 := fact(~n - 1);< 153291#$Ultimate##0 ~n := #in~n; 153850#L25 assume !(~n <= 0); 153286#L26 call #t~ret0 := fact(~n - 1);< 153847#$Ultimate##0 ~n := #in~n; 153853#L25 assume ~n <= 0;#res := 1; 153849#factFINAL assume true; 153846#factEXIT >#70#return; 153844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153764#factFINAL assume true; 153679#factEXIT >#70#return; 153360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153355#factFINAL assume true; 153353#factEXIT >#70#return; 153352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153345#factFINAL assume true; 153321#factEXIT >#70#return; 153315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153307#factFINAL assume true; 153301#factEXIT >#70#return; 153302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153529#factFINAL assume true; 153527#factEXIT >#82#return; 153526#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; 153525#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; 153524#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153271#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153272#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; 153267#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153269#$Ultimate##0 ~n := #in~n; 153293#L25 assume !(~n <= 0); 153287#L26 call #t~ret0 := fact(~n - 1);< 153291#$Ultimate##0 ~n := #in~n; 153850#L25 assume !(~n <= 0); 153286#L26 call #t~ret0 := fact(~n - 1);< 153847#$Ultimate##0 ~n := #in~n; 153850#L25 assume !(~n <= 0); 153286#L26 call #t~ret0 := fact(~n - 1);< 153847#$Ultimate##0 ~n := #in~n; 153850#L25 assume !(~n <= 0); 153286#L26 call #t~ret0 := fact(~n - 1);< 153847#$Ultimate##0 ~n := #in~n; 153850#L25 assume !(~n <= 0); 153286#L26 call #t~ret0 := fact(~n - 1);< 153847#$Ultimate##0 ~n := #in~n; 153850#L25 assume !(~n <= 0); 153286#L26 call #t~ret0 := fact(~n - 1);< 153847#$Ultimate##0 ~n := #in~n; 153853#L25 assume ~n <= 0;#res := 1; 153849#factFINAL assume true; 153846#factEXIT >#70#return; 153844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153764#factFINAL assume true; 153679#factEXIT >#70#return; 153360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153355#factFINAL assume true; 153353#factEXIT >#70#return; 153352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153345#factFINAL assume true; 153321#factEXIT >#70#return; 153315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153307#factFINAL assume true; 153301#factEXIT >#70#return; 153299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153295#factFINAL assume true; 153277#factEXIT >#70#return; 153276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153273#factFINAL assume true; 153266#factEXIT >#78#return; 153261#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 153264#$Ultimate##0 ~n := #in~n; 153316#L25 assume ~n <= 0;#res := 1; 153311#factFINAL assume true; 153260#factEXIT >#80#return; 153239#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153256#$Ultimate##0 ~n := #in~n; 153255#L25 assume !(~n <= 0); 153209#L26 call #t~ret0 := fact(~n - 1);< 153240#$Ultimate##0 ~n := #in~n; 153414#L25 assume !(~n <= 0); 153217#L26 call #t~ret0 := fact(~n - 1);< 153246#$Ultimate##0 ~n := #in~n; 153469#L25 assume !(~n <= 0); 153210#L26 call #t~ret0 := fact(~n - 1);< 153253#$Ultimate##0 ~n := #in~n; 153356#L25 assume !(~n <= 0); 153208#L26 call #t~ret0 := fact(~n - 1);< 153320#$Ultimate##0 ~n := #in~n; 153359#L25 assume !(~n <= 0); 153214#L26 call #t~ret0 := fact(~n - 1);< 153329#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153341#L25 assume ~n <= 0;#res := 1; 153340#factFINAL assume true; 153337#factEXIT >#70#return; 153336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153335#factFINAL assume true; 153328#factEXIT >#70#return; 153327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153325#factFINAL assume true; 153319#factEXIT >#70#return; 153314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153300#factFINAL assume true; 153252#factEXIT >#70#return; 153251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153247#factFINAL assume true; 153243#factEXIT >#70#return; 153241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153238#factFINAL assume true; 153237#factEXIT >#70#return; 153221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153447#factFINAL assume true; 153372#factEXIT >#82#return; 153096#L30-8 [2024-11-23 02:07:35,514 INFO L747 eck$LassoCheckResult]: Loop: 153096#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; 153084#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; 153085#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153059#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; 153060#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153200#$Ultimate##0 ~n := #in~n; 153298#L25 assume !(~n <= 0); 153219#L26 call #t~ret0 := fact(~n - 1);< 153223#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153341#L25 assume ~n <= 0;#res := 1; 153340#factFINAL assume true; 153337#factEXIT >#70#return; 153336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153335#factFINAL assume true; 153328#factEXIT >#70#return; 153327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153325#factFINAL assume true; 153319#factEXIT >#70#return; 153314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153300#factFINAL assume true; 153252#factEXIT >#70#return; 153251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153247#factFINAL assume true; 153243#factEXIT >#70#return; 153241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153238#factFINAL assume true; 153237#factEXIT >#70#return; 153235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153234#factFINAL assume true; 153233#factEXIT >#70#return; 153231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153230#factFINAL assume true; 153228#factEXIT >#70#return; 153220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153225#factFINAL assume true; 153207#factEXIT >#70#return; 153204#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153202#factFINAL assume true; 153199#factEXIT >#78#return; 151170#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 151171#$Ultimate##0 ~n := #in~n; 153236#L25 assume ~n <= 0;#res := 1; 153224#factFINAL assume true; 153205#factEXIT >#80#return; 153098#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 153203#$Ultimate##0 ~n := #in~n; 153232#L25 assume !(~n <= 0); 153213#L26 call #t~ret0 := fact(~n - 1);< 153227#$Ultimate##0 ~n := #in~n; 153294#L25 assume !(~n <= 0); 153211#L26 call #t~ret0 := fact(~n - 1);< 153226#$Ultimate##0 ~n := #in~n; 153414#L25 assume !(~n <= 0); 153217#L26 call #t~ret0 := fact(~n - 1);< 153246#$Ultimate##0 ~n := #in~n; 153469#L25 assume !(~n <= 0); 153210#L26 call #t~ret0 := fact(~n - 1);< 153253#$Ultimate##0 ~n := #in~n; 153356#L25 assume !(~n <= 0); 153208#L26 call #t~ret0 := fact(~n - 1);< 153320#$Ultimate##0 ~n := #in~n; 153359#L25 assume !(~n <= 0); 153214#L26 call #t~ret0 := fact(~n - 1);< 153329#$Ultimate##0 ~n := #in~n; 153339#L25 assume !(~n <= 0); 153218#L26 call #t~ret0 := fact(~n - 1);< 153338#$Ultimate##0 ~n := #in~n; 153341#L25 assume ~n <= 0;#res := 1; 153340#factFINAL assume true; 153337#factEXIT >#70#return; 153336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153335#factFINAL assume true; 153328#factEXIT >#70#return; 153327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153325#factFINAL assume true; 153319#factEXIT >#70#return; 153314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153300#factFINAL assume true; 153252#factEXIT >#70#return; 153251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153247#factFINAL assume true; 153243#factEXIT >#70#return; 153241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153238#factFINAL assume true; 153237#factEXIT >#70#return; 153235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153234#factFINAL assume true; 153233#factEXIT >#70#return; 153229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153838#factFINAL assume true; 153097#factEXIT >#82#return; 153096#L30-8 [2024-11-23 02:07:35,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash -158758374, now seen corresponding path program 14 times [2024-11-23 02:07:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034032445] [2024-11-23 02:07:35,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:35,543 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:35,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850474161] [2024-11-23 02:07:35,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:35,546 INFO L229 MonitoredProcess]: Starting monitored process 267 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:35,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (267)] Waiting until timeout for monitored process [2024-11-23 02:07:35,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:35,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:35,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:35,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:35,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1038288324, now seen corresponding path program 11 times [2024-11-23 02:07:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388093846] [2024-11-23 02:07:35,990 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:35,999 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-23 02:07:35,999 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 166 proven. 486 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-23 02:07:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388093846] [2024-11-23 02:07:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388093846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611127708] [2024-11-23 02:07:36,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:36,321 INFO L229 MonitoredProcess]: Starting monitored process 268 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:36,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (268)] Waiting until timeout for monitored process [2024-11-23 02:07:36,522 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-23 02:07:36,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:36,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-23 02:07:36,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 192 proven. 450 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-23 02:07:36,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 192 proven. 555 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-23 02:07:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611127708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:39,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 35] total 43 [2024-11-23 02:07:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547700768] [2024-11-23 02:07:39,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:39,762 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-23 02:07:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2024-11-23 02:07:39,763 INFO L87 Difference]: Start difference. First operand 3555 states and 6394 transitions. cyclomatic complexity: 2878 Second operand has 44 states, 38 states have (on average 2.236842105263158) internal successors, (85), 37 states have internal predecessors, (85), 24 states have call successors, (25), 1 states have call predecessors, (25), 18 states have return successors, (40), 24 states have call predecessors, (40), 24 states have call successors, (40) [2024-11-23 02:07:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:41,917 INFO L93 Difference]: Finished difference Result 5513 states and 11018 transitions. [2024-11-23 02:07:41,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5513 states and 11018 transitions. [2024-11-23 02:07:41,952 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 804 [2024-11-23 02:07:42,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5513 states to 5463 states and 10960 transitions. [2024-11-23 02:07:42,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1484 [2024-11-23 02:07:42,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1484 [2024-11-23 02:07:42,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5463 states and 10960 transitions. [2024-11-23 02:07:42,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:42,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5463 states and 10960 transitions. [2024-11-23 02:07:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states and 10960 transitions. [2024-11-23 02:07:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 3915. [2024-11-23 02:07:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 2324 states have (on average 1.0309810671256454) internal successors, (2396), 2318 states have internal predecessors, (2396), 1117 states have call successors, (1196), 406 states have call predecessors, (1196), 474 states have return successors, (3979), 1190 states have call predecessors, (3979), 1117 states have call successors, (3979) [2024-11-23 02:07:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 7571 transitions. [2024-11-23 02:07:42,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3915 states and 7571 transitions. [2024-11-23 02:07:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-23 02:07:42,116 INFO L425 stractBuchiCegarLoop]: Abstraction has 3915 states and 7571 transitions. [2024-11-23 02:07:42,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2024-11-23 02:07:42,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3915 states and 7571 transitions. [2024-11-23 02:07:42,129 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 488 [2024-11-23 02:07:42,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:42,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:42,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [63, 63, 42, 42, 42, 42, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:42,130 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-11-23 02:07:42,130 INFO L745 eck$LassoCheckResult]: Stem: 161133#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 160862#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; 160863#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; 160884#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; 161134#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 161270#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 162993#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; 160858#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160859#$Ultimate##0 ~n := #in~n; 163167#L25 assume ~n <= 0;#res := 1; 163166#factFINAL assume true; 163164#factEXIT >#72#return; 161118#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161119#$Ultimate##0 ~n := #in~n; 163217#L25 assume ~n <= 0;#res := 1; 163216#factFINAL assume true; 163214#factEXIT >#74#return; 163211#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163212#$Ultimate##0 ~n := #in~n; 163215#L25 assume ~n <= 0;#res := 1; 163213#factFINAL assume true; 163210#factEXIT >#76#return; 163209#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; 163207#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; 163208#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 163196#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 163197#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; 160836#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160837#$Ultimate##0 ~n := #in~n; 163360#L25 assume !(~n <= 0); 163355#L26 call #t~ret0 := fact(~n - 1);< 164076#$Ultimate##0 ~n := #in~n; 163382#L25 assume ~n <= 0;#res := 1; 163383#factFINAL assume true; 163354#factEXIT >#70#return; 163356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163342#factFINAL assume true; 163345#factEXIT >#78#return; 161126#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161127#$Ultimate##0 ~n := #in~n; 163392#L25 assume ~n <= 0;#res := 1; 163391#factFINAL assume true; 163347#factEXIT >#80#return; 163343#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163346#$Ultimate##0 ~n := #in~n; 164077#L25 assume !(~n <= 0); 163377#L26 call #t~ret0 := fact(~n - 1);< 163387#$Ultimate##0 ~n := #in~n; 163389#L25 assume ~n <= 0;#res := 1; 163376#factFINAL assume true; 163378#factEXIT >#70#return; 163356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163342#factFINAL assume true; 163345#factEXIT >#82#return; 164073#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; 164072#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; 164071#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 164070#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164069#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; 163990#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160839#$Ultimate##0 ~n := #in~n; 163998#L25 assume !(~n <= 0); 163994#L26 call #t~ret0 := fact(~n - 1);< 163996#$Ultimate##0 ~n := #in~n; 164003#L25 assume !(~n <= 0); 163995#L26 call #t~ret0 := fact(~n - 1);< 164001#$Ultimate##0 ~n := #in~n; 164004#L25 assume ~n <= 0;#res := 1; 164002#factFINAL assume true; 164000#factEXIT >#70#return; 163999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163997#factFINAL assume true; 163993#factEXIT >#70#return; 163992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163991#factFINAL assume true; 163989#factEXIT >#78#return; 163984#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 163985#$Ultimate##0 ~n := #in~n; 163987#L25 assume ~n <= 0;#res := 1; 163986#factFINAL assume true; 163982#factEXIT >#80#return; 163943#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163949#$Ultimate##0 ~n := #in~n; 163946#L25 assume !(~n <= 0); 163921#L26 call #t~ret0 := fact(~n - 1);< 163928#$Ultimate##0 ~n := #in~n; 163951#L25 assume !(~n <= 0); 163920#L26 call #t~ret0 := fact(~n - 1);< 163948#$Ultimate##0 ~n := #in~n; 163952#L25 assume ~n <= 0;#res := 1; 163950#factFINAL assume true; 163947#factEXIT >#70#return; 163945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163938#factFINAL assume true; 163936#factEXIT >#70#return; 163937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163979#factFINAL assume true; 163977#factEXIT >#82#return; 163978#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; 164242#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; 164241#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 164240#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164239#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; 163905#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 163912#$Ultimate##0 ~n := #in~n; 163933#L25 assume !(~n <= 0); 163922#L26 call #t~ret0 := fact(~n - 1);< 163928#$Ultimate##0 ~n := #in~n; 163951#L25 assume !(~n <= 0); 163920#L26 call #t~ret0 := fact(~n - 1);< 163948#$Ultimate##0 ~n := #in~n; 163951#L25 assume !(~n <= 0); 163920#L26 call #t~ret0 := fact(~n - 1);< 163948#$Ultimate##0 ~n := #in~n; 163952#L25 assume ~n <= 0;#res := 1; 163950#factFINAL assume true; 163947#factEXIT >#70#return; 163945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163938#factFINAL assume true; 163936#factEXIT >#70#return; 163935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163930#factFINAL assume true; 163918#factEXIT >#70#return; 163916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163914#factFINAL assume true; 163904#factEXIT >#78#return; 163893#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 163897#$Ultimate##0 ~n := #in~n; 163902#L25 assume ~n <= 0;#res := 1; 163900#factFINAL assume true; 163891#factEXIT >#80#return; 163766#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163777#$Ultimate##0 ~n := #in~n; 163768#L25 assume !(~n <= 0); 163734#L26 call #t~ret0 := fact(~n - 1);< 163740#$Ultimate##0 ~n := #in~n; 163783#L25 assume !(~n <= 0); 163732#L26 call #t~ret0 := fact(~n - 1);< 163776#$Ultimate##0 ~n := #in~n; 163783#L25 assume !(~n <= 0); 163732#L26 call #t~ret0 := fact(~n - 1);< 163776#$Ultimate##0 ~n := #in~n; 163782#L25 assume ~n <= 0;#res := 1; 163781#factFINAL assume true; 163775#factEXIT >#70#return; 163767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163761#factFINAL assume true; 163759#factEXIT >#70#return; 163758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163751#factFINAL assume true; 163747#factEXIT >#70#return; 163748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163889#factFINAL assume true; 163885#factEXIT >#82#return; 163881#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; 163878#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; 163876#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 163874#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 163872#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; 163716#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 163726#$Ultimate##0 ~n := #in~n; 163745#L25 assume !(~n <= 0); 163736#L26 call #t~ret0 := fact(~n - 1);< 163740#$Ultimate##0 ~n := #in~n; 163783#L25 assume !(~n <= 0); 163732#L26 call #t~ret0 := fact(~n - 1);< 163776#$Ultimate##0 ~n := #in~n; 163783#L25 assume !(~n <= 0); 163732#L26 call #t~ret0 := fact(~n - 1);< 163776#$Ultimate##0 ~n := #in~n; 163783#L25 assume !(~n <= 0); 163732#L26 call #t~ret0 := fact(~n - 1);< 163776#$Ultimate##0 ~n := #in~n; 163782#L25 assume ~n <= 0;#res := 1; 163781#factFINAL assume true; 163775#factEXIT >#70#return; 163767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163761#factFINAL assume true; 163759#factEXIT >#70#return; 163758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163751#factFINAL assume true; 163747#factEXIT >#70#return; 163746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163741#factFINAL assume true; 163729#factEXIT >#70#return; 163728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163727#factFINAL assume true; 163714#factEXIT >#78#return; 163723#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 163707#$Ultimate##0 ~n := #in~n; 163869#L25 assume ~n <= 0;#res := 1; 163868#factFINAL assume true; 163865#factEXIT >#80#return; 163853#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163861#$Ultimate##0 ~n := #in~n; 163863#L25 assume !(~n <= 0); 163830#L26 call #t~ret0 := fact(~n - 1);< 163836#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163886#L25 assume ~n <= 0;#res := 1; 163882#factFINAL assume true; 163879#factEXIT >#70#return; 163877#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163875#factFINAL assume true; 163873#factEXIT >#70#return; 163871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163870#factFINAL assume true; 163866#factEXIT >#70#return; 163862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163851#factFINAL assume true; 163847#factEXIT >#70#return; 163848#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163864#factFINAL assume true; 163857#factEXIT >#82#return; 163850#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; 163846#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; 163844#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 163837#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 163823#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; 163817#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 163820#$Ultimate##0 ~n := #in~n; 163843#L25 assume !(~n <= 0); 163832#L26 call #t~ret0 := fact(~n - 1);< 163836#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163887#L25 assume !(~n <= 0); 163831#L26 call #t~ret0 := fact(~n - 1);< 163880#$Ultimate##0 ~n := #in~n; 163886#L25 assume ~n <= 0;#res := 1; 163882#factFINAL assume true; 163879#factEXIT >#70#return; 163877#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163875#factFINAL assume true; 163873#factEXIT >#70#return; 163871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163870#factFINAL assume true; 163866#factEXIT >#70#return; 163862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163851#factFINAL assume true; 163847#factEXIT >#70#return; 163845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163838#factFINAL assume true; 163824#factEXIT >#70#return; 163822#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163821#factFINAL assume true; 163814#factEXIT >#78#return; 163819#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 163808#$Ultimate##0 ~n := #in~n; 164025#L25 assume ~n <= 0;#res := 1; 164024#factFINAL assume true; 164023#factEXIT >#80#return; 163603#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163632#$Ultimate##0 ~n := #in~n; 163631#L25 assume !(~n <= 0); 163499#L26 call #t~ret0 := fact(~n - 1);< 163594#$Ultimate##0 ~n := #in~n; 164015#L25 assume !(~n <= 0); 163498#L26 call #t~ret0 := fact(~n - 1);< 163616#$Ultimate##0 ~n := #in~n; 164005#L25 assume !(~n <= 0); 163500#L26 call #t~ret0 := fact(~n - 1);< 163630#$Ultimate##0 ~n := #in~n; 163700#L25 assume !(~n <= 0); 163501#L26 call #t~ret0 := fact(~n - 1);< 163507#$Ultimate##0 ~n := #in~n; 163666#L25 assume !(~n <= 0); 163494#L26 call #t~ret0 := fact(~n - 1);< 163649#$Ultimate##0 ~n := #in~n; 163668#L25 assume ~n <= 0;#res := 1; 163665#factFINAL assume true; 163648#factEXIT >#70#return; 163643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163641#factFINAL assume true; 163635#factEXIT >#70#return; 163634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163633#factFINAL assume true; 163629#factEXIT >#70#return; 163628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163619#factFINAL assume true; 163615#factEXIT >#70#return; 163613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163602#factFINAL assume true; 163591#factEXIT >#70#return; 163592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164365#factFINAL assume true; 164362#factEXIT >#82#return; 164359#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; 164358#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; 164357#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 164356#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164355#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; 163460#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 163462#$Ultimate##0 ~n := #in~n; 163587#L25 assume !(~n <= 0); 163503#L26 call #t~ret0 := fact(~n - 1);< 163507#$Ultimate##0 ~n := #in~n; 163666#L25 assume !(~n <= 0); 163494#L26 call #t~ret0 := fact(~n - 1);< 163649#$Ultimate##0 ~n := #in~n; 163666#L25 assume !(~n <= 0); 163494#L26 call #t~ret0 := fact(~n - 1);< 163649#$Ultimate##0 ~n := #in~n; 163666#L25 assume !(~n <= 0); 163494#L26 call #t~ret0 := fact(~n - 1);< 163649#$Ultimate##0 ~n := #in~n; 163666#L25 assume !(~n <= 0); 163494#L26 call #t~ret0 := fact(~n - 1);< 163649#$Ultimate##0 ~n := #in~n; 163666#L25 assume !(~n <= 0); 163494#L26 call #t~ret0 := fact(~n - 1);< 163649#$Ultimate##0 ~n := #in~n; 163668#L25 assume ~n <= 0;#res := 1; 163665#factFINAL assume true; 163648#factEXIT >#70#return; 163643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163641#factFINAL assume true; 163635#factEXIT >#70#return; 163634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163633#factFINAL assume true; 163629#factEXIT >#70#return; 163628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163619#factFINAL assume true; 163615#factEXIT >#70#return; 163613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163602#factFINAL assume true; 163591#factEXIT >#70#return; 163590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163578#factFINAL assume true; 163493#factEXIT >#70#return; 163491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163466#factFINAL assume true; 163459#factEXIT >#78#return; 163454#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 163457#$Ultimate##0 ~n := #in~n; 163475#L25 assume ~n <= 0;#res := 1; 163474#factFINAL assume true; 163453#factEXIT >#80#return; 163429#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163450#$Ultimate##0 ~n := #in~n; 163442#L25 assume !(~n <= 0); 163398#L26 call #t~ret0 := fact(~n - 1);< 163430#$Ultimate##0 ~n := #in~n; 164027#L25 assume !(~n <= 0); 163397#L26 call #t~ret0 := fact(~n - 1);< 163436#$Ultimate##0 ~n := #in~n; 161124#L25 assume !(~n <= 0); 163400#L26 call #t~ret0 := fact(~n - 1);< 163449#$Ultimate##0 ~n := #in~n; 164055#L25 assume !(~n <= 0); 163399#L26 call #t~ret0 := fact(~n - 1);< 163470#$Ultimate##0 ~n := #in~n; 163786#L25 assume !(~n <= 0); 163401#L26 call #t~ret0 := fact(~n - 1);< 163479#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163683#L25 assume ~n <= 0;#res := 1; 163682#factFINAL assume true; 163677#factEXIT >#70#return; 163676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163673#factFINAL assume true; 163478#factEXIT >#70#return; 163477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163476#factFINAL assume true; 163469#factEXIT >#70#return; 163468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163467#factFINAL assume true; 163448#factEXIT >#70#return; 163441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163438#factFINAL assume true; 163433#factEXIT >#70#return; 163431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163428#factFINAL assume true; 163426#factEXIT >#70#return; 163407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164542#factFINAL assume true; 164537#factEXIT >#82#return; 160843#L30-8 [2024-11-23 02:07:42,131 INFO L747 eck$LassoCheckResult]: Loop: 160843#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; 163206#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; 163202#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 163203#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 163191#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; 163192#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 163390#$Ultimate##0 ~n := #in~n; 163606#L25 assume !(~n <= 0); 163357#L26 call #t~ret0 := fact(~n - 1);< 163358#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163683#L25 assume ~n <= 0;#res := 1; 163682#factFINAL assume true; 163677#factEXIT >#70#return; 163676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163673#factFINAL assume true; 163478#factEXIT >#70#return; 163477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163476#factFINAL assume true; 163469#factEXIT >#70#return; 163468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163467#factFINAL assume true; 163448#factEXIT >#70#return; 163441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163438#factFINAL assume true; 163433#factEXIT >#70#return; 163431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163428#factFINAL assume true; 163426#factEXIT >#70#return; 163425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163422#factFINAL assume true; 163419#factEXIT >#70#return; 163418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163417#factFINAL assume true; 163416#factEXIT >#70#return; 163408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163411#factFINAL assume true; 163396#factEXIT >#70#return; 163395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163394#factFINAL assume true; 163393#factEXIT >#78#return; 163349#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 163359#$Ultimate##0 ~n := #in~n; 163353#L25 assume ~n <= 0;#res := 1; 163348#factFINAL assume true; 163350#factEXIT >#80#return; 163365#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 163364#$Ultimate##0 ~n := #in~n; 163366#L25 assume !(~n <= 0); 163380#L26 call #t~ret0 := fact(~n - 1);< 163585#$Ultimate##0 ~n := #in~n; 163574#L25 assume !(~n <= 0); 163379#L26 call #t~ret0 := fact(~n - 1);< 163381#$Ultimate##0 ~n := #in~n; 163813#L25 assume !(~n <= 0); 163403#L26 call #t~ret0 := fact(~n - 1);< 163421#$Ultimate##0 ~n := #in~n; 164040#L25 assume !(~n <= 0); 163404#L26 call #t~ret0 := fact(~n - 1);< 163427#$Ultimate##0 ~n := #in~n; 164027#L25 assume !(~n <= 0); 163397#L26 call #t~ret0 := fact(~n - 1);< 163436#$Ultimate##0 ~n := #in~n; 161124#L25 assume !(~n <= 0); 163400#L26 call #t~ret0 := fact(~n - 1);< 163449#$Ultimate##0 ~n := #in~n; 164055#L25 assume !(~n <= 0); 163399#L26 call #t~ret0 := fact(~n - 1);< 163470#$Ultimate##0 ~n := #in~n; 163786#L25 assume !(~n <= 0); 163401#L26 call #t~ret0 := fact(~n - 1);< 163479#$Ultimate##0 ~n := #in~n; 163684#L25 assume !(~n <= 0); 163406#L26 call #t~ret0 := fact(~n - 1);< 163678#$Ultimate##0 ~n := #in~n; 163683#L25 assume ~n <= 0;#res := 1; 163682#factFINAL assume true; 163677#factEXIT >#70#return; 163676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163673#factFINAL assume true; 163478#factEXIT >#70#return; 163477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163476#factFINAL assume true; 163469#factEXIT >#70#return; 163468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163467#factFINAL assume true; 163448#factEXIT >#70#return; 163441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163438#factFINAL assume true; 163433#factEXIT >#70#return; 163431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163428#factFINAL assume true; 163426#factEXIT >#70#return; 163425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163422#factFINAL assume true; 163419#factEXIT >#70#return; 163418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163417#factFINAL assume true; 163416#factEXIT >#70#return; 163408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163411#factFINAL assume true; 163396#factEXIT >#70#return; 163395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 163394#factFINAL assume true; 163393#factEXIT >#82#return; 160843#L30-8 [2024-11-23 02:07:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash -158758374, now seen corresponding path program 15 times [2024-11-23 02:07:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:42,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549340213] [2024-11-23 02:07:42,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:42,204 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-23 02:07:42,205 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:42,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247489879] [2024-11-23 02:07:42,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,209 INFO L229 MonitoredProcess]: Starting monitored process 269 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (269)] Waiting until timeout for monitored process [2024-11-23 02:07:43,158 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-23 02:07:43,158 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:43,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:43,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:43,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash -262221316, now seen corresponding path program 12 times [2024-11-23 02:07:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833686991] [2024-11-23 02:07:43,272 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:43,291 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2024-11-23 02:07:43,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-23 02:07:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718307566] [2024-11-23 02:07:43,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:07:43,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:43,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,297 INFO L229 MonitoredProcess]: Starting monitored process 270 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (270)] Waiting until timeout for monitored process [2024-11-23 02:07:43,576 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2024-11-23 02:07:43,577 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:43,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:43,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:43,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2115122155, now seen corresponding path program 16 times [2024-11-23 02:07:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150709985] [2024-11-23 02:07:43,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:43,696 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:43,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 17654 backedges. 2320 proven. 597 refuted. 0 times theorem prover too weak. 14737 trivial. 0 not checked. [2024-11-23 02:07:44,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150709985] [2024-11-23 02:07:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150709985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969401378] [2024-11-23 02:07:44,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,202 INFO L229 MonitoredProcess]: Starting monitored process 271 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (271)] Waiting until timeout for monitored process [2024-11-23 02:07:44,495 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:44,495 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:44,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17654 backedges. 6450 proven. 189 refuted. 0 times theorem prover too weak. 11015 trivial. 0 not checked. [2024-11-23 02:07:44,601 INFO L311 TraceCheckSpWp]: Computing backward predicates...